ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Some Approaches to Index Design for Cube Forest.

Theodore Johnson, Dennis Shasha: Some Approaches to Index Design for Cube Forest. IEEE Data Eng. Bull. 20(1): 27-35(1997)
@article{DBLP:journals/debu/JohnsonS97,
  author    = {Theodore Johnson and
               Dennis Shasha},
  title     = {Some Approaches to Index Design for Cube Forest},
  journal   = {IEEE Data Eng. Bull.},
  volume    = {20},
  number    = {1},
  year      = {1997},
  pages     = {27-35},
  ee        = {db/journals/debu/JohnsonS97.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

The paradigmatic view of data in decision support consists of a set of dimensions (e.g., location, product, time period, ...), each encoding a hierarchy (e.g., location has hemisphere, country, state/province, ..., block) or nearly a hierarchy (there are exceptions: weeks don't fit into months and sizes don't fit into colors). Typical queries consist of aggregates over a quantifiable attribute (e.g., sales) as a function of at most one attribute in each dimension of this "data cube." For example, find the sum of all sales of blue polo shirts in Palm Beach during the last quarter. We discuss a few different alternatives to solve this problem including a data structure called cube forests and its elaboration hierarchically split cube forests that exploit the hierarchical nature of the data to save space. We also discuss some design considerations.

Copyright © 1997 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

Online Edition:

Data Engineering Bulletin March 1997: Supporting On-line Analytical Processing (Daniel Barbara, ed.)
( letter+figures , letter-figures , A4+figures , A4-figures , PDF+figures)

References

[1]
Latha S. Colby, Nancy L. Martin, Robert M. Wehrmeister: Query Processing for Decision Support: The SQLmpp Solution. PDIS 1994: 121-130 BibTeX
[2]
...
[3]
...
[4]
Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159 BibTeX
[5]
Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Index Selection for OLAP. ICDE 1997: 208-219 BibTeX
[6]
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216 BibTeX
[7]
Vincent Y. Lum: Multi-Attribute Retrieval with Combined Indexes. Commun. ACM 13(11): 660-665(1970) BibTeX
[8]
Patrick E. O'Neil: Model 204 Architecture and Performance. HPTS 1987: 40-59 BibTeX

Referenced by

  1. Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi: Flexible Data Cubes for Online Aggregation. ICDT 2001: 159-173
  2. Theodore Johnson, Dennis Shasha: Some Approaches to Index Design for Cude Forests. IEEE Data Eng. Bull. 22(4): 22-30(1999)
  3. Chee Yong Chan, Yannis E. Ioannidis: Hierarchical Prefix Cubes for Range-Sum Queries. VLDB 1999: 675-686
  4. Chung-Min Chen, Munir Cochinwala, Elsa Yueh: Dealing with Slow-Evolving Fact: A Case Study on Inventory Data Warehousing. DOLAP 1999: 22-29
  5. Guido Moerkotte: Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. VLDB 1998: 476-487
  6. Ming-Chuan Wu, Alejandro P. Buchmann: Encoded Bitmap Indexing for Data Warehouses. ICDE 1998: 220-230
  7. Matteo Golfarelli, Stefano Rizzi: Methodological Framework for Data Warehouse Design. DOLAP 1998: 3-9
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Bulletin of the IEEE Computer Society Technical Committee on Data Engineering: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:56:17 2009