Optimizing Queries on Compressed Bitmaps

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Very Large Data Bases Conference

• Publication date

  2000-09-10

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Daytona and the fourth-generation language Cymbal

  1999cited by this paper
• An efficient bitmap encoding scheme for selection queries

  1999cited by this paper
• Query optimization for selections using bitmaps

  1999cited by this paper
• Reclustering of high energy physics data

  1999cited by this paper
• Multidimensional indexing and query coordination for tertiary storage management

  1999cited by this paper
• Performance Measurements of Compressed Bitmap Indices

  1999cited by this paper
• Encoded bitmap indexing for data warehouses

  1998cited by this paper
• Bitmap index design and evaluation

  1998cited by this paper
• Improved query performance with variant indexes

  1997cited by this paper
• Query optimization

  1996cited by this paper
• Byte-aligned bitmap compression

  1995cited by this paper
• Multi-table joins through bitmapped join indices

  1995cited by this paper
• Parameterised compression for sparse bitmaps

  1992cited by this paper
• Randomized algorithms for optimizing large join queries

  1990cited by this paper
• Optimization of large join queries: combining heuristics and combinatorial techniques

  1989cited by this paper
• Statistical profile estimation in database systems

  1988cited by this paper
• Query optimization by simulated annealing

  1987cited by this paper
• On the optimal nesting order for computing N-relational joins

  1984cited by this paper
• Query Optimization in Database Systems

  1984cited by this paper
• Access path selection in a relational database management system

  1979cited by this paper
• Boston

  1906cited by this paper

• Cohort query processing without misleading aging effects

  2025cites this paper
• Multivariate Probabilistic Range Queries for Scalable Interactive 3D Visualization

  2022cites this paper
• Effective Temporal Dependence Discovery in Time Series Data

  2018cites this paper
• Query Log Compression for Workload Analytics

  2018cites this paper
• Binning Strategy for Hierarchical Bitmap Indices with Large Scale Domain Hierarchy

  2016cites this paper
• D B ] 3 M ay 2 01 6 Cohort Query Processing

  2016cites this paper
• Cohort Query Processing

  2016cites this paper
• Research progress in the complexity theory and algorithms of big-data computation

  2016cites this paper
• Building Hierarchical Bitmap Indices in Space Constrained Environments

  2015cites this paper
• The Design and Implementation of Modern Column-Oriented Database Systems

  2013cites this paper
• Minimizing Index Size by Reordering Rows and Columns

  2012cites this paper
• Collaborative Project LOD 2 – Creating Knowledge out of Interlinked Data Deliverable 2 . 3 Integration of MonetDB Technology in Virtuoso

  2011cites this paper
• Column Stores versus Search Engines and Applications to Search in Social Networks

  2011influential citation
• Improve Performance of Data Warehouse by Query Cache

  2010cites this paper
• Position list word aligned hybrid: optimizing space and performance for compressed bitmaps

  2010cites this paper
• Ideal Strategy to Improve Datawarehouse Performance

  2010cites this paper
• Speed up the Search in Bitmap Based Compressed Sparse Arrays

  2009cites this paper
• Data Parallel Bin-Based Indexing for Answering Queries on Multi-core Architectures

  2009cites this paper
• VAST: Analyse von Netzwerkverkehr unabhängig von Raum und Zeit VAST: Network Visibility Across Space and Time

  2009cites this paper
• Enhanced bitmap indexes for large scale data management

  2009cites this paper
• Divide-and-conquer scheme for strictly optimal retrieval of range queries

  2009cites this paper
• Secondary bitmap indexes with vertical and horizontal partitioning

  2009cites this paper
• Query-driven visualization strategies for the analysis and visualization of large, complex datasets

  2009cites this paper
• Accelerating Queries on Very Large Datasets

  2009cites this paper
• Bin-Hash Indexing: A Parallel Method for Fast Query Processing

  2008cites this paper
• Answering preference queries with bit-sliced index arithmetic

  2008cites this paper
• Lawrence Berkeley National Laboratory Recent Work Title Accelerating Queries on Very Large Datasets Permalink

  2008cites this paper
• Query support for multi-dimensional and dynamic databases

  2008cites this paper
• Query execution in column-oriented database systems

  2008cites this paper
• The XQueC Project: Compressing and Querying XML

  2008cites this paper
• Dynamic data organization for bitmap indices

  2008cites this paper
• RadixZip: Linear-Time Compression of Token Streams

  2007cites this paper
• XQueC: A query-conscious compressed XML database

  2007cites this paper
• Analytic use of bitmap indices

  2007cites this paper
• Indexing Scientific Data

  2007cites this paper
• Multi-resolution bitmap indexes for scientific data

  2007cites this paper
• Space-Efficient Structures for Detecting Port Scans

  2007cites this paper
• Optimizing bitmap indices with efficient compression

  2006cites this paper
• Improving Bitmap Index Compression by Data Reorganization

  2006cites this paper
• Integrating compression and execution in column-oriented database systems

  2006cites this paper
• Approximate encoding for direct access and query processing over compressed bitmaps

  2006cites this paper
• Indexing Incomplete Databases

  2006cites this paper
• An Ecien t Compression Scheme For Bitmap Indices

  2006cites this paper
• Answering top-k queries with multi-dimensional selections: the ranking cube approach

  2006cites this paper
• Indexes for Databases with Missing Data

  2006cites this paper
• Improved Bitmap Indexing Strategy for Data Warehouses

  2006influential citation
• Capturing semantics from bitmap indices for data analysis

  2006cites this paper
• Minimizing I/O Costs of Multi-Dimensional Queries with Bitmap Indices

  2006cites this paper
• Optimizing candidate check costs for bitmap indices

  2005cites this paper
• DEX: Increasing the Capability of Scientific Data Analysis Pipelines by Using Efficient Bitmap Indices to Accelerate Scientific Visualization

  2005cites this paper
• Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

  2005cites this paper
• Compressing bitmap indices by data reorganization

  2005cites this paper
• Query-driven visualization of large data sets

  2005cites this paper
• High-Dimensional OLAP: A Minimal Cubing Approach

  2004cites this paper
• An efficient compression scheme for bitmap indices

  2004influential citation
• Approximate query processing in decision support system environment

  2004cites this paper
• Data Compression for Bitmap Indexes

  2004cites this paper
• Efficient binning for bitmap indices on high-cardinality attributes

  2004cites this paper
• On the performance of bitmap indices for high cardinality attributes

  2004cites this paper
• Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, DMKD 2003, San Diego, California, USA, June 13, 2003

  2003cites this paper
• Bitmap techniques for optimizing decision support queries and association rule algorithms

  2003cites this paper
• Bitmap Index Partition Techniques for Continuous and High Cardinality Discrete Attributes

  2003cites this paper
• Efficient OLAP operations for spatial data using peano trees

  2003cites this paper
• Efficient OLAP Operations for Spatial Data Using

  2003cites this paper
• Using attribute value lattice to find closed frequent itemsets

  2003cites this paper
• Building Compressed Database Systems

  2002cites this paper
• Compressing bitmap indexes for faster search operations

  2002cites this paper
• Strategies for processing ad hoc queries on large data warehouses

  2002cites this paper
• Bitmap Indices for Speeding Up High-Dimensional Data Analysis

  2002cites this paper
• Multi-dimensional bitmap indices for optimising data access within object oriented databases at CERN

  2001cites this paper
• Query optimization in compressed database systems

  2001cites this paper
• Encoded bitmap indexes and their use for data warehouse optimization

  2001cites this paper
• Design and implementation of bitmap indices for scientific data

  2001cites this paper
• 53 Multidimensional Databases and OLAP

  year unknowncites this paper