2635 search results - page 156 / 527 » Algorithms for the Database Layout Problem |
123
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
151
click to vote
DATAMINE
1999
15 years 4 months ago
1999
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
140
Voted
COMAD
1994
15 years 5 months ago
1994
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
119
Voted
WISE
2006
Springer
15 years 10 months ago
2006
Springer
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
104
click to vote
KES
2007
Springer
15 years 10 months ago
2007
Springer
The current Information Retrieval Systems return hundreds or thousands of documents in response to a query. Users consider only the first 20 or 30, but documents are often sorted a...