Access the full text.
Sign up today, get DeepDyve free for 14 days.
Yannis Sismanis, Antonios Deligiannakis, N. Roussopoulos, Y. Kotidis (2002)
Dwarf: shrinking the PetaCube
J. Vitter, Min Wang, B. Iyer (1998)
Data cube approximation and histograms via wavelets
The forest covertype dataset. ftp://ftp. ics.uci. edu/pub/machine-learning-databases
Wei Wang, Hongjun Lu, Jianlin Feng, J. Yu (2002)
Condensed cube: an effective approach to reducing data cube sizeProceedings 18th International Conference on Data Engineering
Xiaolei Li, Jiawei Han, Hector Gonzalez (2004)
High-Dimensional OLAP: A Minimal Cubing Approach
(1996)
Data cube: a relational aggregation operator generalizing GROUP-BY, CROSS-TAB, and SUB-TOTALS
Konstantinos Morfonios, Stratis Konakas, Y. Ioannidis, Nikolaos Kotsis (2007)
ROLAP implementations of the data cubeACM Comput. Surv., 39
L. Lakshmanan, J. Pei, Jiawei Han (2002)
Quotient Cube: How to Summarize the Semantics of a Data Cube
L. Lakshmanan, J. Pei, Yan Zhao (2003)
QC-trees: an efficient summary structure for semantic OLAP
Jiawei Han, J. Pei, Guozhu Dong, Ke Wang (2001)
Efficient computation of Iceberg cubes with complex measures
C. Hahn, S. Warren, J. London (1996)
Edited synoptic cloud reports from ships and land stations over the globe
A. Shukla, Prasad Deshpande, J. Naughton (1998)
Materialized View Selection for Multidimensional Datasets
Yannis Sismanis, N. Roussopoulos (2004)
The Complexity of Fully Materialized Coalesced Cubes
Zheng Shao, Jiawei Han, Dong Xin (2004)
MM-Cubing: computing Iceberg cubes by factorizing the lattice spaceProceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.
T. Johnson (1999)
Performance Measurements of Compressed Bitmap Indices
Ying Feng, D. Agrawal, A. Abbadi, Ahmed Metwally (2004)
Range cube: efficient cube computation by exploiting data correlationProceedings. 20th International Conference on Data Engineering
C. Hahn, S. Warren (1999)
Extended Edited Synoptic Cloud Reports from Ships and Land Stations Over the Globe, 1952-1996
Jianlin Feng, Hongjie Si, Yu-cai Feng (2003)
Indexing and incremental updating condensed data cube15th International Conference on Scientific and Statistical Database Management, 2003.
K. Beyer, R. Ramakrishnan (1999)
Bottom-Up Computation of Sparse and Iceberg CUBEs
Sameet Agarwal, R. Agrawal, Prasad Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, Sunita Sarawagi (1996)
On the Computation of Multidimensional Aggregates
Cuiping Li, K. Tung, Shan Wang (2004)
Incremental maintenance of quotient cube based on galois latticeJournal of Computer Science and Technology, 19
Nikolaos Kotsis, D. McGregor (2000)
Elimination of Redundant Views in Multidimensional Aggregates
Konstantinos Morfonios, Y. Ioannidis (2006)
CURE for cubes: cubing using a ROLAP engine
Dong Xin, Jiawei Han, Xiaolei Li, B. Wah (2003)
Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration
K. Ross, D. Srivastava (1997)
Fast Computation of Sparse Datacubes
Y. Chao, G. Zipf (1950)
Human Behavior and the Principle of Least Effort: An Introduction to Human EcologyLanguage, 26
K. Beyer, R. Ramakrishnan (1999)
Bottom-up computation of sparse and Iceberg CUBE, 28
Venky Harinarayan, A. Rajaraman, J. Ullman (1996)
Implementing data cubes efficiently
G. Zipf (2012)
Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology
Cuiping Li, G. Cong, A. Tung, Shan Wang (2004)
Incremental maintenance of quotient cube for medianProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Yihong Zhao, Prasad Deshpande, J. Naughton (1997)
An array-based algorithm for simultaneous multidimensional aggregates
I. Mumick, D. Quass, Barinderpal Mumick (1997)
Maintenance of data cubes and summary tables in a warehouse
Nikos Karayannidis, T. Sellis, Yannis Kouvaras (2004)
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
The lifecycle of a data cube involves efficient construction and storage, fast query answering, and incremental updating. Existing ROLAP methods that implement data cubes are weak with respect to one or more of the above, focusing mainly on construction and storage. In this paper, we present a comprehensive ROLAP solution that addresses efficiently all functionality in the lifecycle of a cube and can be implemented easily over existing relational servers. It is a family of algorithms centered around a purely ROLAP construction method that provides fast computation of a fully materialized cube in compressed form, is incrementally updateable, and exhibits quick query response times that can be improved by low-cost indexing and caching. This is demonstrated through comprehensive experiments on both synthetic and real-world datasets, whose results have shown great promise for the performance and scalability potential of the proposed techniques, with respect to both the size and dimensionality of the fact table.
The VLDB Journal – Springer Journals
Published: Jul 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.