ACM Transactions on Database Systems (TODS)
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
Fundamentals of Data Warehouses
Fundamentals of Data Warehouses
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
Encoded Bitmap Indexing for Data Warehouses
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Range-Based Bitmap Indexing for High Cardinality Attributes with Skew
COMPSAC '98 Proceedings of the 22nd International Computer Software and Applications Conference
Query processing and optimization in Oracle Rdb
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing candidate check costs for bitmap indices
Proceedings of the 14th ACM international conference on Information and knowledge management
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Multi-resolution bitmap indexes for scientific data
ACM Transactions on Database Systems (TODS)
RLH: Bitmap compression technique based on run-length and Huffman encoding
Information Systems
Bitmap indexes for large scientific data sets: a case study
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Time-HOBI: indexing dimension hierarchies by means of hierarchically organized bitmaps
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Using evolving storage structures for data storage
Proceedings of the 8th International Conference on Frontiers of Information Technology
ECOS: evolutionary column-oriented storage
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Data structures for multiversion data warehouse
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
In this paper we propose a hierarchically organized bitmap index (HOBI) for optimizing star queries that filter data and compute aggregates along a dimension hierarchy. HOBI is created on a dimension hierarchy. The index is composed of hierarchically organized bitmap indexes, one bitmap index for one dimension level. It supports range predicates on dimensional values as well as roll-up operations along a dimension hierarchy. HOBI was implemented on top on Oracle10g and evaluated experimentally. Its performance was compared to a native Oracle bitmap join index. Experiments were run on a real dataset, coming from the biggest East-European Internet auction platform Allegro.pl . The experiments show that HOBI offers better star query performance than the native Oracle bitmap join index.