Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Distributed Query Optimization

  • Stéphane BressanEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_708


Query optimization in distributed database systems


Distributed query optimization refers to the process of producing a plan for the processing of a query to a distributed database system. The plan is called a query execution plan. In a distributed database system, schema and queries refer to logical units of data. In a relational distributed relation database system, for instance, logical units of data are relations. These units may be fragmented at the underlying physical level. The fragments, which can be redundant and replicated, are allocated to different database servers in the distributed system.

A query execution plan consists of operators and their allocation to servers. Standard physical operators, usually implementing the data model’s algebra, are used to process data and to consolidate intermediary and final results. Communication operators realize the transfer, sending and receiving, of data from one server to another. In the case of fragmentation the...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bernstein PA, Goodman N, Wong E, Reeve CL, Rothnie Jr JB. Query processing in a system for distributed databases (SDD-1). ACM Trans Database Syst. 1981;6(4):602–25.CrossRefzbMATHGoogle Scholar
  2. 2.
    Ceri S, Pelagatti G. Distributed databases principles and systems. New York: McGraw-Hill; 1984.zbMATHGoogle Scholar
  3. 3.
    Epstein RS, Stonebraker M, Wong E. Distributed query processing in a relational data base system. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1978. p. 169–80.Google Scholar
  4. 4.
    Haas LM, Selinger PG, Bertino E, Daniels D, Lindsay BG, Lohman GM, Masunaga Y, Mohan C, Ng P, Wilms PF, Yost RA. R*: a research project on distributed relational dbms. IEEE Database Eng Bull. 1982;5(4):28–32.Google Scholar
  5. 5.
    Kossmann D. The state of the art in distributed query processing. ACM Comput Surv. 2000;32(4):422–69.CrossRefGoogle Scholar
  6. 6.
    Özsu MT, Valduriez P. Principles of distributed database systems. 2nd ed. 1999.Google Scholar
  7. 7.
    Selinger PG, Adiba ME. Access path selection in distributed database management systems. In: Proceedings of the International Conference on Databases; 1980. p. 204–15.Google Scholar
  8. 8.
    Stonebraker M, Devine R, Kornacker M, Litwin W, Pfeffer A, Sah A, Staelin C. An economic paradigm for query processing and data migration in mariposa. In: Proceedings of the 3rd International Conference Parallel and Distributed Information Systems; 1994. p. 58–67.Google Scholar
  9. 9.
    Urhan T, Franklin MJ, Amsaleg L. Cost based query scrambling for initial delays. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 130–41.CrossRefGoogle Scholar
  10. 10.
    Wong E. Retrieving dispersed data from SDD-1: a system for distributed databases. In: Proceedings of the 2nd Berkeley Workshop on Distributed Data Management and Computer Networks; 1977. p. 217–35.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.National University of Singapore, School of Computing, Department of Computer ScienceSingaporeSingapore

Section editors and affiliations

  • Kian-Lee Tan
    • 1
  1. 1.Dept. of Computer ScienceNational Univ. of SingaporeSingaporeSingapore