303 search results - page 2 / 61 » Bitmap Index Design and Evaluation |
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...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
DAWAK
2005
Springer
13 years 10 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
SBBD
2001
13 years 6 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...