Abstract
This chapter considers the relational algebra operators materialize, sort, groupby, and mergejoin. These operators materialize their input records by saving them in temporary tables. This materialization allows the operators to access their records multiple times without recomputation, which can result in query implementations that are much more efficient than could be achieved using only pipelined operators.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sciore, E. (2020). Materialization and Sorting. In: Database Design and Implementation. Data-Centric Systems and Applications. Springer, Cham. https://doi.org/10.1007/978-3-030-33836-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-33836-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33835-0
Online ISBN: 978-3-030-33836-7
eBook Packages: Computer ScienceComputer Science (R0)