1. An Efficient Nested Query Processing for Distributed Database Systems
- Author
-
Hun-Gi Kim, Yu-Jin Kang, Wan-Sup Cho, Chi-Hawn Choi, and Kyung-En Yang
- Subjects
Distributed database ,View ,Computer science ,Distributed computing ,Online analytical processing ,InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL ,InformationSystems_DATABASEMANAGEMENT ,Query optimization ,Data warehouse ,Database tuning ,Nested SQL ,Nested set model - Abstract
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.
- Published
- 2011
- Full Text
- View/download PDF