Abstract
In decision-support systems, the top k values are more informative than the max/min value. Unfortunately, the existing methods for range-max queries could not answer range top-k queries efficiently if applied directly. In this paper, we propose an efficient approach for range top-k processing, termed the Adaptive Pre-computed Partition Top method (APPT). The APPT method pre-computes a set of maximum values for each partitioned sub-block. The number of stored maximum values can be adjusted dynamically during run-time to adopt to the distribution of the query and the data. We show with experiments that our dynamic adaptation method improves in query cost as compared to other alternative methods.
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.
References
The OLAP Council. MD-API the OLAP Application Program Interface Version 5.0 Specification, 1996.
A. Agrawal, A. Gupta, S. Sarawagi. Modeling Multidimensional Databases. In Proc. 13th Int’l Conf. on Data Engineering, 1997.
J. Gray, A. Bosworth, A. Layman and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tabs and sub-totals. In Proc. 12th Int’l Conf. on Data Engineering, pp. 152–159, 1996.
C. Ho, R. Agrawal, N. Me.ddo and R. Srikant. Range queries in OLAP data cubes. In Proc. ACM SIGMOD Conf. on Management of Data, 1997.
C. Y. Chan, Y. E. Ioannidis. Hierarchical Cubes for Range-Sum Queries. In Proc. 25th Int’l Conf. on Very Large Databases, pp. 675–686, 1999.
S. Ge.ner, D. Agrawal, A.E. Abbadi, T. Smith. Relative Pre.x Sum: An Efficient Approach for Querying Dynamic OLAP Data Cubes. In Proc. 15th Int’l Conf. on Data Engineering, pp. 328–335, 1999.
W. Liang, H. Wang, M. E. Orlowska. Range queries in dynamic OLAP data cube. Data and Knowledge Engineering 34, 2000.
H. G. Li, T. W. Ling, S. Y. Lee, Z. X. Loh. Range-sum queries in Dynamic OLAP data cube. In Proc. 3rd Int’l Symposium on Cooperative Database Systems for Advanced Applications, pp. 74–81, 2001.
D. W. Kim, E.J. Lee, M. H, Kim, Y, J. Lee. An efficient processing of range-MIN/MAX queries over data cube. Information Sciences, pp. 223–237, 1998.
S. Y. Lee, T. W. Ling, H. G. Li. Hierarchical compact cube for range-max queries. In Proc. 26th Int’l Conf. on Very Large Databases, 2000.
H. G. Li, T. W. Ling, S. Y. Lee. Range-Max/Min queries in OLAP data cube. In Proc. 11th Int’l Conf. on Database and Expert Systems Applications, pp. 467–475, 2000.
D. Donjerkovic, R. Ramakrishnan. Probabilistic optimization of top N queries. In Proc. 25th Int’l Conf. on Very Large Databases, 1999.
S. Chaudhuri, L. Gravano. Evaluating Top-k Selection Queries. In Proc. 25th Int’l Conf. on Very Large Databases, 1999.
Z. W. Luo, T. W. Ling, C. H. Ang, S. Y. Lee, H. G. Li. Range Top/Bottom k Queries in OLAP Sparse Data Cubes. In Proc. 12th Int’l Conf. on Database and Expert Systems Applications, pp. 678–687, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loh, Z.X., Ling, T.W., Ang, C.H., Lee, S.Y. (2002). Adaptive Method for Range Top-k Queries in OLAP Data Cubes. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_64
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive