Dynamic bitmap index recompression through workload-based optimizations

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Database Engineering and Applications Symposium

• Publication date

  2013-10-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/2513591.2513641
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimizing Index Size by Reordering Rows and Columns

  2012cited by this paper
• An Exponential Moving Average algorithm

  2012cited by this paper
• Statistical properties of exponentially weighted moving average algorithm for change detection

  2012cited by this paper
• Variable Length Compression for Bitmap Indices

  2011influential reference
• Position list word aligned hybrid: optimizing space and performance for compressed bitmaps

  2010cited by this paper
• Net-Fli: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic

  2010influential reference
• Sorting improves word-aligned bitmap indexes

  2009cited by this paper
• Automatic Workload Management for Enterprise Data Warehouses

  2008cited by this paper
• Analysis of Basic Data Reordering Techniques

  2008cited by this paper
• An Ecien t Compression Scheme For Bitmap Indices

  2006cited by this paper
• Compressing bitmap indices by data reorganization

  2005cited by this paper
• Characterization of database access pattern for analytic prediction of buffer hit probability

  2005cited by this paper
• Optimizing candidate check costs for bitmap indices

  2005cited by this paper
• An efficient compression scheme for bitmap indices

  2004cited by this paper
• Special issue on data management in bioinformatics

  2003cited by this paper
• Compressing bitmap indexes for faster search operations

  2002influential reference
• Self-tuning Database Technology and Information Services: from Wishful Thinking to Viable Engineering

  2002cited by this paper
• LEO - DB2's LEarning Optimizer

  2001cited by this paper
• Adaptive Query Processing: Technology in Evolution

  2000cited by this paper
• KDD-cup 99: knowledge discovery in a charitable organization's donor database

  2000cited by this paper
• Space efficient bitmap indexing

  2000influential reference
• Towards Automated Performance I ’ uning For Complex Workloads *

  1998cited by this paper
• Byte-aligned bitmap compression

  1995influential reference
• Characterization of database access skew in a transaction processing environment

  1992cited by this paper
• Model 204 Architecture and Performance

  1987cited by this paper
• Storage and retrieval considerations of binary data bases

  1985cited by this paper
• Bit Transposed Files

  1985cited by this paper

• Scalable Network Forensics

  2016cites this paper