Multi-table joins through bitmapped join indices
ACM SIGMOD Record
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
The ins and outs (and everything in between) of data warehousing
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Teaching an OLTP Database Kernel Advanced Data Warehousing Techniques
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
| Hi-index | 0.00 |
In this paper we present DataIndexes, a family of design strategies for data warehouses to support OnLine Analytical Processing (OLAP). As the name implies, DataIndexes are both a storage structure for the warehoused relational data and an indexing scheme to provide fast access to that data. We present two simple DataIndexes: the Basic DataIndex (BDI), which can be used for any attribute and the Join DataIndex (JDI), which is used for foreign-key attributes. Either structure can be shown to significantly improve query response times in most cases. And, since they serve as indexes as well as the store of base data, DataIndexes actually define a physical design strategy for a data warehouse where the indexing, for all intents and purposes, comes for "free."