• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Improved query performance with variant indexes (1997)

Cached

  • Download as a PDF

Download Links

  • [www.cse.iitb.ac.in]
  • [www.eecs.umich.edu]
  • [www.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [140.115.82.191]
  • [www-db.stanford.edu]
  • [www-db.stanford.edu]
  • [www.cs.wisc.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Dallan Quass
Citations:139 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

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.

The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University