Adaptive method for range top-k queries in OLAP data cubes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2453, Issue , 2002, Pages 648-657

  Loh, Zheng Xuan ^a   Ling, Tok Wang ^a   Ang, Chuan Heng ^a   Lee, Sin Yeung ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION SUPPORT SYSTEMS; EXPERT SYSTEMS; INFORMATION RETRIEVAL;

ADAPTIVE METHODS; DATA CUBE; DYNAMIC ADAPTATIONS; MAX-QUERY; QUERY COSTS; RANGE TOP-K QUERY; SUB-BLOCKS; TOP-K PROCESSING;

QUERY PROCESSING;

EID: 84949808250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46146-9_64     Document Type: Conference Paper

References (14)

1. The OLAP Council. MD-API the OLAP Application Program Interface Version 5.0 Speci.cation, 1996.
2. A. Agrawal, A. Gupta, S. Sarawagi. Modeling Multidimensional Databases. In Proc. 13th Int’l Conf on Data Engineering, 1997.
3. J. Gray, A. Bosworth, A. Layman and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-y, cross-tabs and sub-totals. In Proc. 12th Int’l Conf on Data Engineering, pp. 152-159, 1996.
4. 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.
5. 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.
6. S. Ge. ner, D. Agrawal, A.E. Abbadi, T. Smith. Relative Pre.x Sum: An E.cient Approach for Querying Dynamic OLAP Data Cubes. In Proc. 15th Int’l Conf. on Data Engineering, pp. 328-335, 1999.
7. W. Liang, H. Wang, M. E. Orlowska. Range queries in dynamic OLAP data cube. Data and Knowledge Engineering34, 2000.
8. 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.
9. D. W. Kim, E. J. Lee, M. H. Kim, Y. J. Lee. An e.cient processing of range-MIN/MAX queries over data cube. Information Sciences, pp. 223-237, 1998.
10. 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.
11. 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.
12. D. Donjerkovic, R. Ramakrishnan. Probabilistic optimization of top N queries. In Proc. 25th Int’l Conf. on Very Large Databases, 1999.
13. S. Chaudhuri, L. Gravano. Evaluating Top-k Selection Queries. In Proc. 25th Int’l Conf. on Very Large Databases, 1999.
14. 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.