HOBI: Hierarchically organized bitmap index for indexing dimensional data

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chmiel, J., Morzy, T., & Wrembel, R. (2009). HOBI: Hierarchically organized bitmap index for indexing dimensional data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5691 LNCS, pp. 87–98). https://doi.org/10.1007/978-3-642-03730-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free