Improved query performance with variant indexes (1997)
Cached
Download Links
| Citations: | 139 - 0 self |
BibTeX
@INPROCEEDINGS{Quass97improvedquery,
author = {Dallan Quass},
title = {Improved query performance with variant indexes},
booktitle = {},
year = {1997},
pages = {38--49},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 index-ing capabilities in the literature. We compare algorithms that become feasible with these variant index types against algo-rithms using more conventional indexes. The analysis demon-strates important performance advantages for variant indexes in some types of SQL aggregation, predicate evaluation, and group-ing. 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 ef-ficiently performed. 1.
Citations
No citations identified.
