An Efficient Nested Query Processing for Distributed Database Systems

Performance of OLAP queries becomes a critical issue as the amount of data in the data warehouses increases rapidly. To solve this performance issue, we proposed a high performance database cluster system called HyperDB in which many PCs can be mobilized for excellent performance. In HyperDB, an OLA...

Full description

Saved in:
Bibliographic Details
Published inConvergence and Hybrid Information Technology pp. 669 - 676
Main Authors Kang, Yu-Jin, Choi, Chi-Hawn, Yang, Kyung-En, Kim, Hun-Gi, Cho, Wan-Sup
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesCommunications in Computer and Information Science
Subjects
Data Warehouse
Distributed Database System
Nested Query
OLAP
Query Parallel Distributed Processing
Online AccessGet full text

Cover

More Information
Summary:Performance of OLAP queries becomes a critical issue as the amount of data in the data warehouses increases rapidly. To solve this performance issue, we proposed a high performance database cluster system called HyperDB in which many PCs can be mobilized for excellent performance. In HyperDB, an OLAP query can be decomposed into sub-queries, and each of the sub-queries can be processed independently on a PC in a short time. But if an OLAP query has nested form (i.e., nested SQL), it could not be decomposed into sub-queries. In this paper, we propose a parallel distributed query processing algorithm for nested queries in HyperDB system. Traditionally, parallel distributed processing of nested queries is known as a difficult problem in the database area.
ISBN:9783642241055
3642241050
ISSN:1865-0929
1865-0937
DOI:10.1007/978-3-642-24106-2_85