Partitioning Algorithms for the Computation of Average Iceberg Queries-Reference-Cited by-同舟云学术

Partitioning Algorithms for the Computation of Average Iceberg Queries

Published:2000 Issue: Volume: Page:276-286
ISSN:0302-9743
Container-title:Data Warehousing and Knowledge Discovery
language:
Short-container-title:

Author:

Bae Jinuk,Lee Sukho

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44466-1_27

Reference12 articles.

1. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman, ”Computing Iceberg Queries Efficiently”, In Proc. of the 24th VLDB Conf., pages 299–310, 1998

2. R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Fang, ” Exploratory Mining and Pruning Optimizations of Constrained Associations Rules”, In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 13–24, 1998

3. K. Beyer and R. Ramakrishnan, ” Bottom-Up Computation of Sparse and Iceberg CUBEs”, In Proc. of the ACM SIGMOD Conf., pages 359–370, 1999

4. A. Savasere, E. Omiecinski, and S. Navathe, ”An Efficient Algorithm for Mining Association Rules in Large Databases”, In Proc. of the 21st VLDB Conf., pages 432–444, 1995

5. S. Christodoulakis, ” Multimedia Data Base Management: Applications and A Position Paper”, In Proc. of the ACM SIGMOD Conf, pages 304–305, 1985

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tracking Pointer Based Approach for Iceberg Query Evaluation;Proceedings of the International Conference on Data Engineering and Communication Technology;2016-08-25

2. Efficient Iceberg Query Evaluation in Distributed Databases by Developing Deferred Strategies;Advances in Intelligent Systems and Computing;2016

3. On Incorporating Iceberg Queries in Query Processors;Database Systems for Advanced Applications;2004