Fragmentation: a technique for efficient query processing

1 June 1986

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems

Vol. 11 (2) , 113-133
https://doi.org/10.1145/5922.5638

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.

Keywords

This publication has 19 references indexed in Scilit:

Implementation techniques for main memory database systems
Published by Association for Computing Machinery (ACM) ,1984
Practical hardware for linear execution of relational database operations
ACM SIGMOD Record, 1983
Why sort-merge gives the best implementation of the natural join
ACM SIGMOD Record, 1983
On optimizing an SQL-like nested query
ACM Transactions on Database Systems, 1982
A new way to compute the product and join of relations
Published by Association for Computing Machinery (ACM) ,1980
Systolic (VLSI) arrays for relational database operations
Published by Association for Computing Machinery (ACM) ,1980
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems, 1979
Distributed query processing in a relational data base system
Published by Association for Computing Machinery (ACM) ,1978
Storage and access in relational data bases
IBM Systems Journal, 1977
A relational model of data for large shared data banks
Communications of the ACM, 1970