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...
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...
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...
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...
— 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...