Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes-Reference-Cited by-同舟云学术

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

Published:2002 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02
language:
Short-container-title:

Author:

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

Affiliation:

1. National University of Singapore

Publisher

ACM Press

Reference14 articles.

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, and J. Y. An efficient processing of range-min/max queries over data cube. In Info. Sciences, pages 223--237, Tucson, Arizona, 1998.

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

1. Cluster Method of Description of Information System Data Model Based on Multidimensional Approach;Communications in Computer and Information Science;2016

2. Extracting k most important groups from data efficiently;Data & Knowledge Engineering;2008-08

3. Evaluation of Top-k OLAP Queries Using Aggregate R–Trees;Advances in Spatial and Temporal Databases;2005

4. An efficient algorithm to rank the partial-sum queries results;2006 7th International Baltic Conference on Databases and Information Systems