Range sum query processing in parallel data warehouses

Author

Jianzhong, Li ; Hong, Gao

Author_Institution

Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., China

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

877

Lastpage

881

Abstract

Online analytical processing (OLAP) is a critical component of data warehouse. Most of today´s OLAP applications work on data warehouses with a centralized structure in which a single database contains huge amounts of data. A range query is a very popular and important operation on OLAP data cube in finding trends or relations between attributes. Methods of computing range query in a centralized data warehouse environment have been well studied. But to the best of our knowledge, there is no literature to date to discuss how to deal with the range query in a PC cluster-based parallel data warehouse. We present a parallel data cube storage structure, called parallel hierarchical data cube (PHDC). The analytical results show that PHDC may achieve better load-balance and optimum speed-up for range sum queries.

Keywords

data mining; data models; data warehouses; parallel databases; query processing; resource allocation; workstation clusters; OLAP data cube; PC cluster; online analytical processing; parallel data cube storage; parallel data warehouse; parallel hierarchical data cube; range sum query processing; Acceleration; Aggregates; Application software; Computer science; Costs; Data warehouses; Delay; Parallel processing; Query processing; Relational databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236437

Filename

1236437