Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 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
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A case for dynamic view management
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
Aggregate Aware Caching for Multi-Dimensional Queries
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd 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
Dynamic Caching of Query Results for Decision Support Systems
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
CURE for cubes: cubing using a ROLAP engine
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Efficient computation of view subsets
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Mapgraph: efficient methods for complex olap hierarchies
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Hierarchical clustering for OLAP: the CUBE File approach
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic Materialization of Query Views for Data Warehouse Workloads
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Sidera: a cluster-based server for online analytical processing
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
| Hi-index | 0.00 |
Contemporary data warehouses now represent some of the world's largest databases. As these systems grow in size and complexity, however, it becomes increasingly difficult for brute force query processing approaches to meet the performance demands of end users. Certainly, improved indexing and more selective view materialization are helpful in this regard. Nevertheless, with warehouses moving into the multi-terabyte range, it is clear that the minimization of external memory accesses must be a primary performance objective. In this paper, we describe the R 3-cache, a natively multi-dimensional caching framework designed specifically to support sophisticated warehouse/OLAP environments. R 3-cache is based upon an in-memory version of the R-tree that has been extended to support buffer pages rather than disk blocks. A key strength of the R 3-cache is that it is able to utilize multi-dimensional fragments of previous query results so as to significantly minimize the frequency and scale of disk accesses. Moreover, the new caching model directly accommodates the standard relational storage model and provides mechanisms for pro-active updates that exploit the existence of query "hot spots". The current prototype has been evaluated as a component of the Sidera DBMS, a "shared nothing" parallel OLAP server designed for multi-terabyte analytics. Experimental results demonstrate significant performance improvements relative to simpler alternatives.