Sciweavers

274 search results - page 2 / 55
» Computational complexity of queries based on itemsets
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 5 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali
ADC
2006
Springer
169views Database» more  ADC 2006»
13 years 11 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 5 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 5 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
DEXA
2004
Springer
161views Database» more  DEXA 2004»
13 years 10 months ago
Computing the Topological Relationship of Complex Regions
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
Markus Schneider