Skip to main content

Indexing of Data Warehouses

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems
  • 15 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Amer-Yahia S, Johnson T. Optimizing queries on compressed bitmaps. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000. p. 329–38.

    Google Scholar 

  2. Apaydin T, Canahuate G, Ferhatosmanoglu H, Tosun A. Approximate encoding for direct access and query processing over compressed bitmaps. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006. p. 846–57.

    Google Scholar 

  3. Johnson T. Coarse indices for a tape-based data warehouse. In: Proceedings of the 14th International Conference on Data Engineering; 1998. p. 231–40.

    Google Scholar 

  4. Johnson T, Shasha D. Some approaches to index design for cube forest. IEEE Data Eng Bull. 1997;20(1):27–35.

    Google Scholar 

  5. Kline N, Snodgrass R. Computing temporal aggregates. In: Proceedings of the 11th International Conference on Data Engineering; 1995. p. 222–31.

    Google Scholar 

  6. Kotidis Y, Roussopoulos N. An alternative storage organization for ROLAP aggregate views based on cubetrees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 249–58.

    Article  Google Scholar 

  7. Moerkotte G. Small materialized aggregates: a light weight index structure for data warehousing. In: Proceedings of the 24th International Conference on Very Large Data Bases; 1998. p. 476–87.

    Google Scholar 

  8. O’Neil P, Quass D. Improved query performance with variant indices. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 38–49.

    Google Scholar 

  9. Rdb7: Performance enhancements for 32 and 64 bit systems. Available online at. http://www.oracle.com/products/servers/rdb/html/fsvlm.html

  10. Wu K, Koegler WS, Chen J, Shoshani A. Using bitmap index for interactive exploration of large datasets. In: Proceedings of the 15th International Conference on Scientific and Statistical Database Management; 2003. p. 65–74.

    Google Scholar 

  11. Wu K, Otoo EJ, Shoshani A. Compressing bitmap indexes for faster search operations. In: Proceedings of the 14th International Conference on Scientific and Statistical Database Management; 2002. p. 99–108.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Theodore Johnson .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Johnson, T. (2018). Indexing of Data Warehouses. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_200

Download citation

Publish with us

Policies and ethics