ACM Transactions on Database Systems (TODS)
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
View maintenance issues for the chronicle data model (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
DynaMat: a dynamic view management system for data warehouses
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The active MultiSync controller of the cubetree storage organization
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Compressed data cubes for OLAP aggregate query approximation on continuous dimensions
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
R-tree implementation using branch-grafting method
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Index filtering and view materialization in ROLAP environment
Proceedings of the tenth international conference on Information and knowledge management
A case for dynamic view management
ACM Transactions on Database Systems (TODS)
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Achieving scalability in OLAP materialized view selection
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Efficient Aggregation Algorithms for Compressed Data Warehouses
IEEE Transactions on Knowledge and Data Engineering
Aggregation Algorithms for Very Large Compressed Data Warehouses
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
OLAP Query Processing Algorithm Based on Relational Storage
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Shared Index Scans for Data Warehouses
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Flexible Data Cubes for Online Aggregation
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Handbook of massive data sets
Aggregate view management in data warehouses
Handbook of massive data sets
SISYPHUS: the implementation of a chunk-based storage manager for OLAP data cubes
Data & Knowledge Engineering - Special issue: Advances in OLAP
An aggregation algorithm using a multidimensional file in multidimensional OLAP
Information Sciences: an International Journal
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Serving Datacube Tuples from Main Memory
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Hash-Based Symmetric Data Structure and Join Algorithm for OLAP Applications
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Multidimensional models: constructing data CUBE
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
Semi-closed cube: an effective approach to trading off data cube size and query response time
Journal of Computer Science and Technology
Processing partially specified queries over high-dimensional databases
Data & Knowledge Engineering
Processing star queries on hierarchically-clustered fact tables
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A one-pass aggregation algorithm with the optimal buffer size in multidimensional OLAP
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
ROLAP implementations of the data cube
ACM Computing Surveys (CSUR)
Hierarchical clustering for OLAP: the CUBE File approach
The VLDB Journal — The International Journal on Very Large Data Bases
FCLOS: A client-server architecture for mobile OLAP
Data & Knowledge Engineering
The Opsis project: materialized views for data warehouses and the web
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Revisiting the cube lifecycle in the presence of hierarchies
The VLDB Journal — The International Journal on Very Large Data Bases
An efficient implementation for MOLAP basic data structure and its evaluation
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Real-time data warehousing for business intelligence
Proceedings of the 8th International Conference on Frontiers of Information Technology
Ag-Tree: a novel structure for range queries in data warehouse environments
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Evaluation of top-k OLAP queries using aggregate r–trees
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Memory-efficient groupby-aggregate using compressed buffer trees
Proceedings of the 4th annual Symposium on Cloud Computing
Hi-index | 0.00 |
The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing with decision support applications. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary tables appropriate subsets of aggregate views which are then engaged in speeding up OLAP queries. However, a straight forward relational storage implementation of materialized ROLAP views is immensely wasteful on storage and incredibly inadequate on query performance and incremental update speed. In this paper we propose the use of Cubetrees, a collection of packed and compressed R-trees, as an alternative storage and index organization for ROLAP views and provide an efficient algorithm for mapping an arbitrary set of OLAP views to a collection of Cubetrees that achieve excellent performance. Compared to a conventional (relational) storage organization of materialized OLAP views, Cubetrees offer at least a 2-1 storage reduction, a 10-1 better OLAP query performance, and a 100-1 faster updates. We compare the two alternative approaches with data generated from the TPC-D benchmark and stored in the Informix Universal Server (IUS). The straight forward implementation materializes the ROLAP views using IUS tables and conventional B-tree indexing. The Cubetree implementation materializes the same ROLAP views using a Cubetree Datablade developed for IUS. The experiments demonstrate that the Cubetree storage organization is superior in storage, query performance and update speed.