10 search results - page 1 / 2 » Encoded Bitmap Indexing for Data Warehouses |
ICDE
1998
IEEE
13 years 9 months ago
1998
IEEE
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...
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...
DAWAK
2001
Springer
13 years 9 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...