By Topic

Range sum query processing in parallel data warehouses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li Jianzhong ; Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., China ; Gao Hong

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.

Published in:

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

Date of Conference:

27-29 Aug. 2003