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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexandre, A.B., et al.: Parallel OLAP Query Processing in Database Clusters with Data Replication. Distributed and Parallel Databases 25(1-2), 97–123 (2009)
Akal, F., Böhm, K., Schek, H.-J.: OLAP query evaluation in a database cluster: A performance study on intra-query parallelism. In: Manolopoulos, Y., Návrat, P. (eds.) ADBIS 2002. LNCS, vol. 2435, pp. 218–231. Springer, Heidelberg (2002)
Inmon, W.H.: Building the data warehouse, 2nd edn. John Wiley&Sons, Inc, West Sussex (1996)
Kim, T.K., et al.: HyperDB: A PC-Based Database Cluster System for efficient OLAP Query Processing. In: Proc. of 19th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2007), Cambridge, USA (November 2007)
Kim, T.K., et al.: A LanLinux-Based Grid System for Bioinformatics Applications. In: Proc. of International Conference on Advanced Communication Technology (ICACT), vol. 3, pp. 2187–2192 (February 2006)
Kim, T.K., et al.: A Hybrid Grid and Its Application to Clustering Orthologous Groups for Multiple Genomes. In: Proc. International Symposium on Computational Life Science, pp. 11–20 (2006)
Ganski, R.A., Wong, H.K.T.: Optimization of Nested SQL Queries Revisited. ACM Transaction on Database System, 23–33 (1987)
TPC (Transaction Processing Performance Councile) Benchmark, http://www.tpc.org/tpcd/default.asp
Kim, W.: On Optimizing and SQL-like Nested Query. ACM Transaction on Database System 7(3), 443–469 (1982)
Kang, Y.J., et al.: An OLAP Query Decomposition Technique for PC-based Database Cluster Systems. In: Proc. of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2009), Innsbruck, Austria (February 2009)
Kang, Y.J., et al.: A Query Decomposition Technique for Nested Query on Database Cluster System Environment. Korea Institute of Information Technology Architecture 7(1), 89–96 (2010)
Colliat, G.: OLAP, Relational and Multidimensional Database System. In: Proc. ACM SIGMOD Record, vol. 25(3) (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, YJ., Choi, CH., Yang, KE., Kim, HG., Cho, WS. (2011). An Efficient Nested Query Processing for Distributed Database Systems. In: Lee, G., Howard, D., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2011. Communications in Computer and Information Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24106-2_85
Download citation
DOI: https://doi.org/10.1007/978-3-642-24106-2_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24105-5
Online ISBN: 978-3-642-24106-2
eBook Packages: Computer ScienceComputer Science (R0)