Synonyms
Query optimization in distributed database systems
Definition
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 via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
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.
Ceri S, Pelagatti G. Distributed databases principles and systems. New York: McGraw-Hill; 1984.
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.
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.
Kossmann D. The state of the art in distributed query processing. ACM Comput Surv. 2000;32(4):422–69.
Özsu MT, Valduriez P. Principles of distributed database systems. 2nd ed. 1999.
Selinger PG, Adiba ME. Access path selection in distributed database management systems. In: Proceedings of the International Conference on Databases; 1980. p. 204–15.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Bressan, S. (2018). Distributed Query Optimization. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_708
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_708
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering