Advertisement

Query Evaluation Techniques for Cluster Database Systems

  • Andrey V. Lepikhov
  • Leonid B. Sokolinsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6295)

Abstract

The paper is dedicated to a problem of effective query processing in cluster database systems. An original approach to data allocation and replication at nodes of a cluster system is presented. On the basis of this approach the load balancing method is developed. Also, we propose a new method for parallel query processing on the cluster systems. All described methods have been implemented in “Omega” parallel database management system prototype. Our experiments show that “Omega” system demonstrates nearly linear scalability even in presence of data skew.

Keywords

Load Balance Query Processing Cluster System Input Stream Cluster Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of ACM 51(1), 107–113 (2008)CrossRefGoogle Scholar
  2. 2.
    Chaudhuri, S., Narasayya, V.: Self-tuning database systems: a decade of progress. In: Proceedings of the 33rd International Conference on Very Large Data Bases, Vienna, Austria, September 23-27, pp. 3–14 (2007)Google Scholar
  3. 3.
    Xu, Y., Kostamaa, P., Zhou, X., Chen, L.: Handling data skew in parallel joins in shared-nothing systems. In: Proceedings of ACM SIGMOD International Conference on Management of Data Vancouver, Canada, June 9-12, pp. 1043–1052. ACM, New York (2008)Google Scholar
  4. 4.
    Han, W., Ng, J., Markl, V., Kache, H., Kandil, M.: Progressive optimization in a shared-nothing parallel database. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, Beijing, China, June 11-14, pp. 809–820 (2007)Google Scholar
  5. 5.
    Zhou, J., Cieslewicz, J., Ross, K.A., Shah, M.: Improving database performance on simultaneous multithreading processors. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30-September 2, pp. 49–60 (2005)Google Scholar
  6. 6.
    Lakshmi, M.S., Yu, P.S.: Effect of Skew on Join Performance in Parallel Architectures. In: Proceedings of the First International Symposium on Databases in Parallel and Distributed Systems, Austin, Texas, United States, pp. 107–120. IEEE Computer Society Press, Los Alamitos (1988)CrossRefGoogle Scholar
  7. 7.
    Ferhatosmanoglu, H., Tosun, A.S., Canahuate, G., Ramachandran, A.: Efficient parallel processing of range queries through replicated declustering. Distrib. Parallel Databases 20(2), 117–147 (2006)CrossRefGoogle Scholar
  8. 8.
    Kostenetskii, P.S., Lepikhov, A.V., Sokolinskii, L.B.: Technologies of parallel database systems for hierarchical multiprocessor environments. Automation and Remote Control 5, 112–125 (2007)MathSciNetGoogle Scholar
  9. 9.
    Sokolinsky, L.B.: Organization of Parallel Query Processing in Multiprocessor Database Machines with Hierarchical Architecture. Programming and Computer Software 27(6), 297–308 (2001)MATHCrossRefGoogle Scholar
  10. 10.
    Lepikhov, A.V., Sokolinsky, L.B.: Data Placement Strategy in Hierarchical Symmetrical Multiprocessor Systems. In: Proceedings of Spring Young Researchers Colloquium in Databases and Information Systems (SYRCoDIS 2006), June 1-2, pp. 31–36. Moscow State University, Moscow (2006)Google Scholar
  11. 11.
    Parallel DBMS “Omega” official page, http://omega.susu.ru

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Andrey V. Lepikhov
    • 1
  • Leonid B. Sokolinsky
    • 1
  1. 1.South Ural State UniversityChelyabinskRussia

Personalised recommendations