See this document in CiteSeerX!

Quasi-Cubes: A space-efficient way to support approximate multidimensional databases (1998)  (Make Corrections)  (4 citations)
Daniel Barbara, Mark Sullivan



  Home/Search   Context   Related

 
View or download:
gmu.edu/~dbarbara/qcube.ps
gmu.edu/~dbarbara/qcube.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  gmu.edu/~dbarbara/spub (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A data cube is a popular organization for summary data. A cube is simply a multidimensional structure that contains at each point an aggregate value, i.e., the result of applying an aggregate function to an underlying relation. In practical situations, cubes can require a large amount of storage. The typical approach to reducing storage cost is to materialize parts of the cube on demand. Unfortunately, this lazy evaluation can be a time-consuming operation. In this paper, we propose an... (Update)

Context of citations to this paper:   More

.... as well as approximations such as histogram compression using the DCT transform [17] or wavelets [24] Perhaps closest to our approach is [1], which uses linear regression to model DataCubes. Bitmaps are relatively recent method for efficiently computing counts from highly...

...the space into buckets dynamically. There are recent proposals for both fixed grid and variable grid algorithms. Regression is used in [1] and wavelets in [11] These are fixed grid techniques that use the approximation function and occasionally outliers to obtain a higher...

Cited by:   More
Using Wavelet Decomposition to Support Progressive and.. - Wu, Agrawal, Abbadi (2000)   (Correct)
Summary Grids: Building Accurate Multidimensional Histograms - Furtado, Madeira (1999)   (Correct)
Analysis of Accuracy of Data Reduction Techniques - Furtado, Madeira   (Correct)

Active bibliography (related documents):   More   All
0.5:   Design and Implementation of On-Line Analytical Processing.. - Stefanovic (1997)   (Correct)
0.5:   Entropy Based Approximate Querying and Exploration of Datacubes - Palpanas, Koudas   (Correct)
0.4:   Using Loglinear Models to Compress Datacubes - Barbará, Wu (1999)   (Correct)

Similar documents based on text:   More   All
1.2:   Journal of Intelligent Information Systems, 16, 255--276.. - Loglinear-Based Quasi..   (Correct)
0.2:   Juno-2 Language Definition - Nelson, Heydon (1997)   (Correct)
0.2:   The Juno-2 Constraint-Based Drawing Editor - Heydon, Nelson (1994)   (Correct)

Related documents from co-citation:   More   All
3:   Data cube: A relational aggregation operator generalizing group-by - Gray, Bosworth et al. - 1996
2:   Selectivity estimation without the attribute value independence assumption - Poosala, Ioannidis - 1997
2:   An Array-Based Algorithm for Simultaneous Multidimensional Aggregates - Zhao, Deshpande et al. - 1997

BibTeX entry:   (Update)

Daniel Barbara. Quasi-cubes: A space-efficient way to support approximate multidimensional databases. Technical report, ISE Dept., George Mason University, 1998. http://citeseer.ist.psu.edu/barbara98quasicubes.html   More

@misc{ barbara98quasicubes,
  author = "D. Barbara",
  title = "Quasi-cubes: A space-efficient way to support approximate multidimensional
    databases",
  text = "Daniel Barbara. Quasi-cubes: A space-efficient way to support approximate
    multidimensional databases. Technical report, ISE Dept., George Mason University,
    1998.",
  year = "1998",
  url = "citeseer.ist.psu.edu/barbara98quasicubes.html" }
Citations (may not include all citations):
2133   Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
1064   A Theory for Multiresolution Signal Decomposition: the Wavel.. (context) - Mallat - 1989
983   The Art of Scientific Computing (context) - Press, Teukolsky et al. - 1996
770   Orthonormal Bases of Compactly Supported Wavelets (context) - Daubechies - 1988
393   Data Cube: A Relational Aggregation Operator Generalizing Gr.. - Gray, Bosworth et al. - 1996
329   Principal Component Analysis (context) - Jolliffe - 1986
248   Implementing Data Cubes Efficiently - Harinarayan, Rajaraman et al. - 1996
196   Linear Algebra and its Applications (context) - Strang - 1980
194   Online Aggregation - Hellerstein, Haas et al. - 1997
168   Non-negative matrices and Markov Chains (context) - Seneta - 1980
165   Research problems in data warehousing - Widom - 1995
64   Latent Semantic Indexing: A Probabilistic Analysis - Papadimitriou, Raghavan et al. - 1998
52   Latent semantic indexing (context) - Dumais - 1994
46   Adaptive Selectivity Estimation Using Query Feedback - Chen, Roussopoulos - 1994
33   Efficiently Supporting Ad Hoc Queries in Large Datasets of T.. - Korn, Jagadish et al. - 1997
32   Recursive estimation and time-series analysis (context) - Young - 1984
29   The New Jersey Data Reduction Report (context) - Barbar'a, DuMouchel et al. - 1997
22   An Introduction to Categorical Data Analysis (context) - Agresti - 1996
19   Introductory Statistics (context) - Wonnacott, Wonnacott - 1985
19   Information Retrieval from an Incomplete Data Cube - Dyreson - 1996
17   Some Approaches to Index Design for Cube Forests (context) - Johnson, Shasha - 1997
13   Relational and Multidimensional Database Systems (context) - Colliat - 1996
9   Designing the Data Warehouse on Relational Databases (context) - Technology
7   Bulletin of the Technical Committee on Data Engineering (context) - Sarawagi, data - 1997
4   Bit string compressor with boolean operation processing capa.. (context) - Glaser, DesJardins et al. - 1991
3   Fast Computations of Sparse Cubes (context) - Srivastava, Ross - 1997
2   Approximate Query Processing with Summary Tables in Statisti.. (context) - Abad-Mota - 1992
1   The Data Warehouse Toolkit: How to Design Dimensional Data W.. (context) - Kimball - 1996

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC