|
Title:
|
FRAMEWORK OF BITMAP INDICES AND PARALLEL DATA RETRIEVAL FOR LARGE SCALE DATA WAREHOUSE ON GRID |
|
Author(s):
|
Han-chieh Wei , Scott Dancer , Srinivas Kolluru , Erich Peterson |
|
ISBN:
|
978-972-8924-44-7 |
|
Editors:
|
Pedro Isaías , Miguel Baptista Nunes and João Barroso (associate editors Luís Rodrigues and Patrícia Barbosa) |
|
Year:
|
2007 |
|
Edition:
|
V I, 2 |
|
Keywords:
|
Bitmap index, Data warehouse, parallel data retrieval |
|
Type:
|
Full Paper |
|
First Page:
|
329 |
|
Last Page:
|
336 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The amount of information which is being generated by todays e-science and customer-centric applications is staggering.
It is common for such applications to consist of hundreds of terabytes (TB) even petabytes of data. The major bottleneck
in analyzing the collected/simulated data is the retrieval of subsets from the storage system. The bottleneck results from
locating the requested data and retrieving the subsets which are spread over distributed files in network file systems or
data grid. It is a common task to issue multi-dimensional queries for the subset creation. However, the traditional index
structures such as B+-tree and R-tree are optimized for either single dimension or modest number of dimensions. It has
been proved that bitmap indices are efficient multi-dimensional index structures for handling complex ad hoc queries in
read mostly environment. In this paper, we present a framework for efficient data retrieval by integrating variants of
bitmap indices and parallel file systems for a large data warehouse application implemented in a grid environment. |
|
|
|
|
|
|
