Sciweavers

708 search results - page 58 / 142
» A Genetic Algorithm for Database Query Optimization
Sort
View
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 3 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
SIGMOD
2008
ACM
129views Database» more  SIGMOD 2008»
14 years 9 months ago
An xml index advisor for DB2
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 1 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
DAWAK
2006
Springer
14 years 16 days ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
13 years 9 days ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...