Sciweavers

Share
31 search results - page 1 / 7
» On the performance of bitmap indices for high cardinality at...
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
10 years 6 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
DEXA
2000
Springer
132views Database» more  DEXA 2000»
10 years 5 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
10 years 7 months ago
Update Conscious Bitmap Indices
Bitmap indices have been widely used in several domains such as data warehousing and scientific applications due to their efficiency in answering certain query types over large ...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
SSDBM
2003
IEEE
105views Database» more  SSDBM 2003»
10 years 6 months ago
Using Bitmap Index for Interactive Exploration of Large Datasets
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
Kesheng Wu, Wendy S. Koegler, Jacqueline Chen, Ari...
CIKM
2005
Springer
10 years 6 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
books