Sciweavers

79 search results - page 2 / 16
» Optimizing Queries on Compressed Bitmaps
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 10 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
CIKM
2009
Springer
13 years 12 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
13 years 10 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
13 years 11 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
CIKM
2005
Springer
13 years 10 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu