Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 60-67

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Analysis; OLAP data cube; Range query; Top k

Indexed keywords

ALGORITHMS; DECISION SUPPORT SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; POISSON DISTRIBUTION; QUERY LANGUAGES;

DATA CUBES; ONLINE ANALYTICAL PROCESSING; RANGE QUERY;

DATA WAREHOUSES;

EID: 0037664328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584806     Document Type: Conference Paper

References (14)

1. A. Agrawal, A. Gupta, and S. Sarawagi. Modeling multidimensional databases. In Proc. of 13th Int'l Conf. on Data Engineering, Birmingham, U. K., Apr. 1997.
2. C. Y. Chan and Y. E. Ioannidis. Hierarchical cubes for range-sum queries. In Proc. of 25th Int'l Conf. on Very Large Databases, pages 675-686, Edinburgh, Scotland, Sep. 1999.
3. S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In Proc. of 25th Int'l Conf. on Very Large Databases, pages 397-410, Edinburgh, Scotland, Sep. 1999.
4. D. Donjerkovic and R. Ramakrishnan. Probabilistic optimization of top n queries. In Proc. of 25th Int'l Conf. on Very Large Databases, pages 411-422, Edinburgh, Scotland, Sep. 1999.
5. D.W. Kim, E.J. Lee, M. Kim, An efficient processing of range-min/max queries over data cube. In Info. Sciences, pages 223-237, Tucson, Arizona, 1998.
6. 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. of 15th Int'l Conf. on Data Engineering, pages 152-159, New Orleans, Louisiana, Mar. 1996.
7. H.G. Li, T.W. Ling, and S.Y.Lee. Range-max queries in olap data cube. In Proc. of 11th Int'l Conf. on Database and Expert Systems Applications, pages 467-475, London/Greenwich, UK, Sep. 2000.
8. H.G.Li, T.W.Ling, S.Y.Lee, and Z.X.Loh, Range-sum queries in dynamic olap data cube. In Proc. of 3rd Int'l Symposium on Cooperative Database Systems for Advanced Applications, pages 79-86, Beijing, China, Apr. 2001.
9. C. Ho, R. Agrawal, N. Mefiddo, and R. Srikant. Range queries in olap data cubes. In Proc. of ACM SIGMOD Conf. on Management of Data, pages 73-88, Tucson, Arizona, USA, May 1997.
10. W. Liang, H. Wang, and M. E. Orlowska. Range queries in dynamic olap data cube. Data and Knowledge Engineering, 34(1):21-38, 2000.
11. S.Geffner, D.Agrawal, A.E.Abbadi, and T.Smith. Relative prefix sum: An efficient approach for querying dynamic olap data cubes. In Proc. of 15th Int'l Conf. on Data Engineering, pages 328-335, Sydney, Australia, Mar. 1999.
12. S.Y.Lee, T.W.Ling, and H.G.Li. Hierarchical compact cube for range-max queries. In Proc. of 26th Int'l Conf. on Very Large Databases, pages 232-241, Cairo, Egypt, Sep. 2000.
13. Z.W.Luo, T.W.Ling, C.H.Ang, S.Y.Lee, and B.Cui. Range top/bottom k queries in olap sparse data cubes. In Proc. of 12th Int'l Conf. on Database and Expert Systems Applications, pages 678-687, Munich, Germany, Sep. 2001.
14. Z.X.Loh, T.W.Ling, C.H.Ang, and S.Y.Lee. Adaptive method for range top-k queries in olap data cubes. In Proc. of 13th Int'l Conf. on Database and Expert Systems Applications, Aix-En Province, France, Sep. 2002.