Abstract
Chapter 7 shows how a calculus query expressed on global relations can be mapped into a query on relation fragments by decomposition and data localization. This mapping uses the global and fragment schemas. During this process, the application of transformation rules permits the simplification of the query by eliminating common subexpressions and useless expressions. This type of optimization is independent of fragment characteristics such as cardinalities. The query resulting from decomposition and localization can be executed in that form simply by adding communication primitives in a systematic way. However, the permutation of the ordering of operations within the query can provide many equivalent strategies to execute it. Finding an “optimal” ordering of operations for a given query is the main role of the query optimization layer, or optimizer for short.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science + Business Media, LLC
About this chapter
Cite this chapter
Özsu, M.T., Valduriez, P. (2011). Optimization of Distributed Queries. In: Principles of Distributed Database Systems, Third Edition. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8834-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8834-8_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-8833-1
Online ISBN: 978-1-4419-8834-8
eBook Packages: Computer ScienceComputer Science (R0)