Fragmentation: a technique for efficient query processing

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.

[1]  William P. Heising,et al.  Note on Random Addressing Techniques , 1963, IBM Syst. J..

[2]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[3]  David Elliot Shaw.  A Relational Database Machine Architecture , 1980, Computer Architecture for Non-Numeric Processing.

[4]  Won Kim,et al.  On optimizing an SQL-like nested query , 1982, TODS.

[5]  Dan E. Willard,et al.  Efficient processing of relational calculus expressions using range query theory , 1984, SIGMOD '84.

[6]  Giovanni Maria Sacco,et al.  A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model , 1982, VLDB.

[7]  Domenico Saccà,et al.  Database partitioning in a cluster of processors , 1983, TODS.

[8]  PramanikSakti,et al.  Use of graph-theoretic models for optimal relational database accesses to perform join , 1985 .

[9]  Michael Stonebraker,et al.  Distributed query processing in a relational data base system , 1978, SIGMOD Conference.

[10]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[11]  Sakti Pramanik,et al.  Use of graph-theoretic models for optimal relational database accesses to perform join , 1985, TODS.

[12]  Randy H. Katz,et al.  Distributing a database for parallelism , 1983, SIGMOD '83.

[13]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[14]  S. B. Yao,et al.  Optimization of query evaluation algorithms , 1979, ACM Trans. Database Syst..

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[17]  David Elliot Shaw.  A Relational Database Machine Architecture , 1980, CAW '80.

[18]  H. T. Kung,et al.  Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[19]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .

[20]  T. H. Merrett,et al.  Why sort-merge gives the best implementation of the natural join , 1983, SGMD.

[21]  M. W. Blasgen,et al.  Storage and Access in Relational Data Bases , 1977, IBM Syst. J..

[22]  T. H. Merrett.  Practical hardware for linear execution of relational database operations , 1983, SGMD.

[23]  J. V. Bradley.  Distribution-Free Statistical Tests , 1968 .

[24]  Edward Babb,et al.  Implementing a relational database by means of specialzed hardware , 1979, TODS.

[25]  Yuen Ren Chao,et al.  Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology , 1950 .

[26]  SaccoGiovanni Maria.  Fragmentation: a technique for efficient query processing , 1986 .

[27]  Giovanni Maria Sacco,et al.  Buffer management in relational database systems , 1986, TODS.

[28]  Won Kim,et al.  A new way to compute the product and join of relations , 1980, SIGMOD '80.

[29]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.