Optimizing bitmap indices with efficient compression

This publication has 19 references indexed in Scilit:

• Strategies for processing ad hoc queries on large data warehouses
  Published by Association for Computing Machinery (ACM) ,2002
• A performance comparison of bitmap indexes
  Published by Association for Computing Machinery (ACM) ,2001
• An overview of data warehousing and OLAP technology
  ACM SIGMOD Record, 1997
• Query processing and optimization in Oracle Rdb
  The VLDB Journal, 1996
• Multi-table joins through bitmapped join indices
  ACM SIGMOD Record, 1995
• Efficient signature file methods for text retrieval
  IEEE Transactions on Knowledge and Data Engineering, 1995
• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
  The Computer Journal, 1993
• Order-preserving minimal perfect hash functions and information retrieval
  ACM Transactions on Information Systems, 1991
• Ubiquitous B-Tree
  ACM Computing Surveys, 1979
• A universal algorithm for sequential data compression
  IEEE Transactions on Information Theory, 1977