Abstract
A “divide and conquer” strategy to compute natural joins by sequential scans on unordered relations is described. This strategy is shown to always he better than merging SCBIIS when both relations must he sorted before joining, and generally better in practical cases when only the largest relation mutt be sorted. © 1986, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Sacco, G. M. (1986). Fragmentation: A Technique for Efficient Query Processing. ACM Transactions on Database Systems (TODS), 11(2), 113–133. https://doi.org/10.1145/5922.5638
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free