31 search results - page 1 / 7 » On the performance of bitmap indices for high cardinality at... |
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
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...
DEXA
2000
Springer
13 years 9 months ago
2000
Springer
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...
SSDBM
2007
IEEE
13 years 10 months ago
2007
IEEE
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 ...
SSDBM
2003
IEEE
13 years 9 months ago
2003
IEEE
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 ...
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
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 ...