Range-Max/Min Query in OLAP Data Cube-Reference-Cited by-同舟云学术

Range-Max/Min Query in OLAP Data Cube

Published:2000 Issue: Volume: Page:467-476
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Li Hua-Gang,Ling Tok Wang,Lee Sin Yeung

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44469-6_44

Reference11 articles.

1. R. Agrawal, A. Gupta. S. Sarawagi. Modeling multidimensional databases. In Proc. of the 13th Int’l Conference on Data Engineering, Birmingham, U.K., April 1997.

2. J. L. Bentley. Multidimensional divide and conquer. Comm. ACM, 23(4): 214–229, 1980.

3. C. Y. Chan, Yannis E. Ioannidis. Hierarchical Cubes for Range-Sum Queries. Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp 675–686.

4. E. F. Codd. Providing OLAP(on-line analytical processing) to user-analysts: an IT mandate. Technical report, E.F. Codd and Associates, 1993.

5. S. Geffner, D. Agrawal, A. EI Abbadi, T. Smith. Algorithms for the Relative Prefix Sum Approach to Range sum Queries in Data Cubes. University of California, Santa Barbara, Computer Science Technical Report TRCS99-01.

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

1. Space-Efficient Range-Sum Queries in OLAP;Data Warehousing and Knowledge Discovery;2004

2. Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes;Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02;2002

3. Adaptive Method for Range Top-k Queries in OLAP Data Cubes;Lecture Notes in Computer Science;2002

4. Variable Sized Partitions for Range Query Algorithms;Lecture Notes in Computer Science;2002

5. Range Top/Bottom k Queries in OLAP Sparse Data Cubes;Lecture Notes in Computer Science;2001