Space-efficient cubes for OLAP range-sum queries-Reference-Cited by-同舟云学术

Space-efficient cubes for OLAP range-sum queries

Published:2004-04 Issue:1 Volume:37 Page:83-102
ISSN:0167-9236
Container-title:Decision Support Systems
language:en
Short-container-title:Decision Support Systems

Author:

Chun Seok-Ju,Chung Chin-Wan,Lee Seok-Lyong

Publisher

Elsevier BV

Subject

Information Systems and Management,Arts and Humanities (miscellaneous),Developmental and Educational Psychology,Information Systems,Management Information Systems

Reference22 articles.

1. Automatic subspace clustering of high dimensional data for data mining applications;Agrawal,1998

2. D. Barbara, M. Sullivan, A space-efficient way support approximate multidimensional databases, George Mason University Technical Report ISSE-TR-98-03, 1998.

3. The R*-tree: an efficient and robust access method for points and rectangles;Beckmann,1990

4. Hierarchical cubes for range-sum queries;Chan,1999

5. Towards the building of a dense-region based OLAP system;Cheung,2001

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

1. Sparse prefix sums: Constant-time range sum queries over sparse multidimensional data cubes;Information Systems;2019-05

2. Sparse Prefix Sums;Advances in Databases and Information Systems;2017

3. Efficient Online Aggregates in Dense-Region-Based Data Cube Representations;Transactions on Large-Scale Data- and Knowledge-Centered Systems II;2010

4. Efficient Online Aggregates in Dense-Region-Based Data Cube Representations;Data Warehousing and Knowledge Discovery;2009

5. An efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in OLAP;Decision Support Systems;2007-03