4541 search results - page 472 / 909 » Cache-Oblivious Algorithms and Data Structures |
152
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
157
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
252
Voted
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
141
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
136
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...