Digital Symposium Collection 2000  

 
 
 
 
 
 

 



















Hierarchical Prefix Cubes for Range-Sum Queries

Chee Yong Chan and Yannis E. Ioannidis

  View Paper (PDF)  

Return to Aggregation Algorithms

Abstract
A range-sum query sums over all selected cells of an OLAP data cube where the selection is specified by ranges of contiguous values for each dimension. An efficient approach to process such queries is to precompute a prefix cube (PC), which is a cube of the same dimensionality and size as the original data cube but with a prefix range-sum stored in each cell. Using a PC, any range-sum query can be evaluated at a cost that is independent of the size of the sub-cube circumscribed by the query. However, a drawback of PCs is that they are very costly to maintain. Recently, a variant of prefix cubes called Relative Prefix Cubes (RPC) has been proposed to alleviate this problem.

In this paper, we propose a new class of cube representations called Hierarchical Cubes, which is based on a design framework defined by two orthogonal dimensions. Our results show that a particular cube design called the Hierarchical Band Cube (HBC) is the overall winner: it not only has a significantly better query-update tradeoff than previous approaches, but it can also be more effectively buffered.


References

Note: References link to DBLP on the Web.

[1]
Chee Yong Chan , Yannis E. Ioannidis : Bitmap Index Design and Evaluation. SIGMOD Conference 1998 : 355-366
[2]
...
[3]
...
[4]
Steven Geffner , Divyakant Agrawal , Amr El Abbadi , Terence R. Smith : Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes. ICDE 1999 : 328-335
[5]
Ching-Tien Ho , Rakesh Agrawal , Nimrod Megiddo , Ramakrishnan Srikant : Range Queries in OLAP Data Cubes. SIGMOD Conference 1997 : 73-88
[6]
Theodore Johnson , Dennis Shasha : Some Approaches to Index Design for Cube Forest. Data Engineering Bulletin 20(1) : 27-35(1997)
[7]
Guido Moerkotte : Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. VLDB 1998 : 476-487
[8]
Inderpal Singh Mumick , Dallan Quass , Barinderpal Singh Mumick : Maintenance of Data Cubes and Summary Tables in a Warehouse. SIGMOD Conference 1997 : 100-111
[9]
Patrick E. O'Neil , Dallan Quass : Improved Query Performance with Variant Indexes. SIGMOD Conference 1997 : 38-49
[10]
Nick Roussopoulos , Yannis Kotidis , Mema Roussopoulos : Cubetree: Organization of and Bulk Updates on the Data Cube. SIGMOD Conference 1997 : 89-99
[11]
...
[12]
Sunita Sarawagi : Indexing OLAP Data. Data Engineering Bulletin 20(1) : 36-43(1997)
[13]
John R. Smith , Chung-Sheng Li , Vittorio Castelli , Anant Jhingran : Dynamic Assembly of Views in Data Cubes. PODS 1998 : 274-283
[14]
Jeffrey Scott Vitter , Min Wang : Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets. SIGMOD Conference 1999 : 193-204

BIBTEX

@inproceedings{DBLP:conf/vldb/ChanI99,
  author    = {Chee Yong Chan and
                Yannis E. Ioannidis},
   editor    = {Malcolm P. Atkinson and
                Maria E. Orlowska and
                Patrick Valduriez and
                Stanley B. Zdonik and
                Michael L. Brodie},
   title     = {Hierarchical Prefix Cubes for Range-Sum Queries},
   booktitle = {VLDB'99, Proceedings of 25th International Conference on Very
                Large Data Bases, September 7-10, 1999, Edinburgh, Scotland,
                UK},
   publisher = {Morgan Kaufmann},
   year      = {1999},
   isbn      = {1-55860-615-5},
   pages     = {675-686},
   crossref  = {DBLP:conf/vldb/99},
   bibsource = {DBLP, http://dblp.uni-trier.de} } },


























Copyright(C) 2000 ACM