Abstract
Iceberg queries are to compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. It’s difficult to execute these queries because the number of unique data is greater than the number of counter buckets in memory. However, previous research has the limitation that average functions were out of consideration among aggregate functions. So, in order to compute average iceberg queries efficiently we introduce the theorem to select candidates by means of partitioning, and propose POP algorithm based on it. The characteristics of this algorithm are to partition a relation logically and to postpone partitioning to use memory efficiently until all buckets are occupied with candidates. Experiments show that proposed algorithm is affected by memory size, data order, and the distribution of data set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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
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
K. Beyer and R. Ramakrishnan, ” Bottom-Up Computation of Sparse and Iceberg CUBEs”, In Proc. of the ACM SIGMOD Conf., pages 359–370, 1999
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
S. Christodoulakis, ” Multimedia Data Base Management: Applications and A Position Paper”, In Proc. of the ACM SIGMOD Conf, pages 304–305, 1985
A. Ghafoor, ”Multimedia Database Management System”, Computing Surveys, Vol. 27, No. 4, pages 593–598, 1985
K. Whang, B. T. Vander-Zanden, and H. M. Taylor, ”A Linear-time Probabilistic Counting Algorithms for DB Applications”, ACM Transactions on Database Systems, 15(2):208–229, 1990
J. S. Park, M. S. Chen, and P. S. Yu, ”An Effiective Hash Based Algorithm For Mining Association Rules”, In Proc. of ACM SIGMOD Conf., pages 175–186, 1995
R. Agrawal and R. Srikant, ”Fast Algorithms for Mining Association Rules”, In Proc. of the 20th VLDB Conf., pages 487–499, 1994
R. T. Ng and J. Han, ”Efficient and Effiective Clustering Method for Spatial Data Mining”, In Proc. of the 20th VLDB Conf., pages 144–155, 1994
T. Zhang, R. Ramakrishnan, and M. Livny, ” BIRCH: An Efficient Data Clustering Method for Very Large Databases”, In Proc. of ACM SIGMOD Conf., pages 103–114, 1996
A. Bouju, A. Stockus, F. Bertrand, P. Boursier, ”Client-Server Architecture for Accessing Multimedia and Geographic Databases within Embedded Systems”, DEXA Workshop 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, J., Lee, S. (2000). Partitioning Algorithms for the Computation of Average Iceberg Queries. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2000. Lecture Notes in Computer Science, vol 1874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44466-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-44466-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67980-6
Online ISBN: 978-3-540-44466-4
eBook Packages: Springer Book Archive