Improved query performance with variant indexes
Authors:
Open Access
- 1 June 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 26 (2) , 38-49
Abstract
The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updates are present. The current paper presents a short review of current indexing technology, including row-set representation by Bitmaps, and then introduces two approaches we call Bit-Sliced indexing and Projection indexing. A Projection index materializes all values of a column in RID order, and a Bit-Sliced index essentially takes an orthogonal bit-by-bit view of the same data. While some of these concepts started with the MODEL 204 product, and both Bit-Sliced and Projection indexing are now fully realized in Sybase IQ, this is the first rigorous examination of such indexing capabilities in the literature. We compare algorithms that become feasible with these variant index types against algorithms using more conventional indexes. The analysis demonstrates important performance advantages for variant indexes in some types of SQL aggregation, predicate evaluation, and grouping. The paper concludes by introducing a new method whereby multi-dimensional group-by queries, reminiscent of OLAP/Datacube queries but with more flexibility, can be very efficiently performed.Keywords
This publication has 5 references indexed in Scilit:
- Implementing data cubes efficiently1996
- Multi-table joins through bitmapped join indicesACM SIGMOD Record, 1995
- “One size fits all” database architectures do not work for DSS1995
- The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time1987
- Ubiquitous B-TreeACM Computing Surveys, 1979