Join and Semijoin Algorithms for a Multiprocessor Database Machine.
Patrick Valduriez, Georges Gardarin:
Join and Semijoin Algorithms for a Multiprocessor Database Machine.
ACM Trans. Database Syst. 9(1): 133-161(1984)@article{DBLP:journals/tods/ValduriezG84,
author = {Patrick Valduriez and
Georges Gardarin},
title = {Join and Semijoin Algorithms for a Multiprocessor Database Machine},
journal = {ACM Trans. Database Syst.},
volume = {9},
number = {1},
year = {1984},
pages = {133-161},
ee = {http://doi.acm.org/10.1145/348.318590, db/journals/tods/ValduriezG84.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
This paper presents and analyzes algorithms for computing joins and semijoins of
relations in a multiprocessor database machine. First, a model of the multiprocessor
architecture is described, incorporating parameters defining I/O, CPU, and message
transmission times that permit calculation of the execution times of these algorithms.
Then, three join algorithms are presented and compared. It is shown that, for a given
configuration, each algorithm has an application domain defined by the characteristics
of the operand and result relations. Since a semijoin operator is useful for decreasing
I/O and transmission times in a multiprocessor system, we present and compare two
equi-semijoin algorithms and one non-equi-semijoin algorithm. The execution times of
these algorithms are generally linearly proportional to the size of the operand and
result relations, and inversely proportional to the number of processors. We then
compare a method which consists of joining two relations to a method whereby one joins
their semijoins. Finally, it is shown that the latter method, using semijoins, is
generally better. The various algorithms presented are implemented in the SABRE
database system; an evaluation model selects the best algorithm for performing a join
according to the results presented here. A first version of the SABRE system is
currently operational at INRIA.
Copyright © 1984 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
References
- [1]
- H. Auer, W. Hell, Hans-Otto Leilich, J. S. Lie, Heinz Schweppe, S. Seehusen, Günther Stiege, W. Teich, Hans Christoph Zeidler:
RDBM - A relational data base machine.
Inf. Syst. 6(2): 91-100(1981) BibTeX
- [2]
- Edward Babb:
Implementing a Relational Database by Means of Specialized Hardware.
ACM Trans. Database Syst. 4(1): 1-29(1979) BibTeX
- [3]
- François Bancilhon, Michel Scholl:
On Designing an I/O Processor for a Relational Data Base Machine.
SIGMOD Conference 1980: 93-93g BibTeX
- [4]
- Jayanta Banerjee, David K. Hsiao, Richard I. Baum:
Concepts and Capabilities of a Database Computer.
ACM Trans. Database Syst. 3(4): 347-384(1978) BibTeX
- [5]
- Philip A. Bernstein, Dah-Ming W. Chiu:
Using Semi-Joins to Solve Relational Queries.
J. ACM 28(1): 25-40(1981) BibTeX
- [6]
- ...
- [7]
- ...
- [8]
- Mike W. Blasgen, Kapali P. Eswaran:
Storage and Access in Relational Data Bases.
IBM Systems Journal 16(4): 362-377(1977) BibTeX
- [9]
- Dina Bitton, Haran Boral, David J. DeWitt, W. Kevin Wilkinson:
Parallel Algorithms for the Execution of Relational Database Operations.
ACM Trans. Database Syst. 8(3): 324-353(1983) BibTeX
- [10]
- ...
- [11]
- Donald D. Chamberlin, A. M. Gilbert, Robert A. Yost:
A History of System R and SQL/Data System (Invited Paper).
VLDB 1981: 456-464 BibTeX
- [12]
- D. M. Chiu, Y. C. Ho:
A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions.
SIGMOD Conference 1980: 169-178 BibTeX
- [13]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970) BibTeX
- [14]
- David J. DeWitt:
Query Execution in DIRECT.
SIGMOD Conference 1979: 13-22 BibTeX
- [15]
- Haran Boral, David J. DeWitt:
Design Considerations for Data-flow Database Machines.
SIGMOD Conference 1980: 94-104 BibTeX
- [16]
- ...
- [17]
- ...
- [18]
- ...
- [19]
- Leo R. Gotlieb:
Computing Joins of Relations.
SIGMOD Conference 1975: 55-63 BibTeX
- [20]
- ...
- [21]
- Kjell Karlsson:
Reduced Cover-Trees and their Application in the Sabre Access Path Model.
VLDB 1981: 345-353 BibTeX
- [22]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [23]
- Jean Le Bihan, Christian Esculier, Gérard Le Lann, Witold Litwin, Georges Gardarin, S. Sedillort, L. Treille:
SIRIUS: A French Nationwide Project on Distributed Data Bases.
VLDB 1980: 75-85 BibTeX
- [24]
- Esen A. Ozkarahan, Stewart A. Schuster, Kenneth C. Sevcik:
Performance Evaluation of a Relational Associative Processor.
ACM Trans. Database Syst. 2(2): 175-195(1977) BibTeX
- [25]
- Franco P. Preparata:
New Parallel-Sorting Schemes.
IEEE Trans. Computers 27(7): 669-673(1978) BibTeX
- [26]
- James B. Rothnie Jr., Philip A. Bernstein, Stephen Fox, Nathan Goodman, Michael Hammer, T. A. Landers, Christopher L. Reeve, David W. Shipman, Eugene Wong:
Introduction to a System for Distributed Databases (SDD-1).
ACM Trans. Database Syst. 5(1): 1-17(1980) BibTeX
- [27]
- ...
- [28]
- Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held:
The Design and Implementation of INGRES.
ACM Trans. Database Syst. 1(3): 189-222(1976) BibTeX
- [29]
- ...
- [30]
- ...
Referenced by
- Alfons Kemper, Donald Kossmann, Christian Wiesner:
Generalised Hash Teams for Join and Group-by.
VLDB 1999: 30-41
- Ming-Syan Chen, Hui-I Hsiao, Philip S. Yu:
On Applying Hash Filters to Improving the Execution of Multi-Join Queries.
VLDB J. 6(2): 121-131(1997)
- Chihping Wang, Ming-Syan Chen:
On the Complexity of Distributed Query Optimization.
IEEE Trans. Knowl. Data Eng. 8(4): 650-662(1996)
- Luc Bouganim, Daniela Florescu, Patrick Valduriez:
Dynamic Load Balancing in Hierarchical Parallel Database Systems.
VLDB 1996: 436-447
- Chengwen Liu, Hao Chen:
A Hash Partition Strategy for Distributed Query Processing.
EDBT 1996: 373-387
- Nadejda Biscondi, André Flory, Lionel Brunie:
Parallel Databases: Structured Query Optimization.
ADBIS 1996: 146-152
- Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honesty C. Young:
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins.
IEEE Trans. Knowl. Data Eng. 7(4): 656-668(1995)
- Patrick Martin, Per-Åke Larson, Vinay Deshpande:
Parallel Hash-Based Join Algorithms for a Shared-Everything.
IEEE Trans. Knowl. Data Eng. 6(5): 750-763(1994)
- Mikal Ziane, Mohamed Zaït, Pascale Borla-Salamet:
Parallel Query Processing with Zigzag Trees.
VLDB J. 2(3): 277-301(1993)
- Gultekin Özsoyoglu, Aladdin Hafez:
Near-Optimum Storage Models for Nested Relations Based on Workload Information.
IEEE Trans. Knowl. Data Eng. 5(6): 1018-1038(1993)
- Chaitanya K. Baru, Sriram Padmanabhan:
Join and Data Redistribution Algorithms for Hypercubes.
IEEE Trans. Knowl. Data Eng. 5(1): 161-168(1993)
- Ming-Syan Chen, Hui-I Hsiao, Philip S. Yu:
Applying Hash Filters to Improving the Execution of Bushy Trees.
VLDB 1993: 505-516
- Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït:
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces.
VLDB 1993: 493-504
- Soon Myoung Chung, Jaerheen Yang:
Distributive Join Algorithm for Cube-Connected Multiprocessors.
DASFAA 1993: 253-260
- Priti Mishra, Margaret H. Eich:
Join Processing in Relational Databases.
ACM Comput. Surv. 24(1): 63-113(1992)
- Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu:
Scheduling and Processor Allocation for Parallel Execution of Multi-Join Queries.
ICDE 1992: 58-67
- Dennis Shasha, Jason Tsong-Li Wang:
Optimizing Equijoin Queries In Distributed Databases Where Relations Are Hash Partitioned.
ACM Trans. Database Syst. 16(2): 279-308(1991)
- Hongjun Lu, Ming-Chien Shan, Kian-Lee Tan:
Optimization of Multi-Way Join Queries for Parallel Execution.
VLDB 1991: 549-560
- Joel L. Wolf, Daniel M. Dias, Philip S. Yu, John Turek:
An Effective Algorithm for Parallelizing Hash Joins in the Presence of Data Skew.
ICDE 1991: 200-209
- Masaru Kitsuregawa, Miyuki Nakano, Mikio Takagi:
Performance Evaluation of Functional Disk System (FDS-R2).
ICDE 1991: 416-425
- Frédéric Andrès, Michel Couprie, Yann Viémont:
A Multi-Environment Cost Evaluator for Parallel Database Systems.
DASFAA 1991: 126-135
- M. Seetha Lakshmi, Philip S. Yu:
Effectiveness of Parallel Joins.
IEEE Trans. Knowl. Data Eng. 2(4): 410-424(1990)
- Hansjörg Zeller, Jim Gray:
An Adaptive Hash Join Algorithm for Multiuser Environments.
VLDB 1990: 186-197
- Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan:
Hash-Based Join Algorithms for Multiprocessor Computers.
VLDB 1990: 198-209
- Masaru Kitsuregawa, Yasushi Ogawa:
Bucket Spreading Parallel Hash: A New, Robust, Parallel Hash Join Method for Data Skew in the Super Database Computer (SDC).
VLDB 1990: 210-221
- Balakrishna R. Iyer, Daniel M. Dias:
System Issues in Parallel Sorting for Database Systems.
ICDE 1990: 246-255
- Edward Omiecinski, Eileen Tien Lin:
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers.
IEEE Trans. Knowl. Data Eng. 1(3): 329-343(1989)
- Balakrishna R. Iyer, Gary R. Ricard, Peter J. Varman:
Percentile Finding Algorithm for Multiple Sorted Runs.
VLDB 1989: 135-144
- Donovan A. Schneider, David J. DeWitt:
A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment.
SIGMOD Conference 1989: 110-121
- M. Seetha Lakshmi, Philip S. Yu:
Limiting Factors of Join Performance on Parallel Processors.
ICDE 1989: 488-496
- Ghassan Z. Qadah:
Filter-Based Join Algorithms on Uniprocessor and Distributed-Memory Multiprocessor Database Machines.
EDBT 1988: 388-413
- Jiawei Han, Ghassan Z. Qadah, Chinying Chaou:
The Processing and Evaluation of Transitive Closure Queries.
EDBT 1988: 49-75
- Patrick Valduriez:
Join Indices.
ACM Trans. Database Syst. 12(2): 218-246(1987)
- James P. Richardson, Hongjun Lu, Krishna P. Mikkilineni:
Design and Evaluation of Parallel Pipelined Join Algorithms.
SIGMOD Conference 1987: 399-409
- Roger Shultz, Ila Miller:
Tree Structured Multiple Processor Join Methods.
ICDE 1987: 190-199
- Alexis Koster:
Parallel Processing of Relational Databases on a Cellular Tree Machine.
ICDE 1987: 200-207
- Setrag Khoshafian, George P. Copeland, Thomas Jagodis, Haran Boral, Patrick Valduriez:
A Query Processing Strategy for the Decomposed Storage Model.
ICDE 1987: 636-643
- Leonard D. Shapiro:
Join Processing in Database Systems with Large Main Memories.
ACM Trans. Database Syst. 11(3): 239-264(1986)
- Stéphane Lafortune, Eugene Wong:
A State Transition Model for Distributed Query Processing.
ACM Trans. Database Syst. 11(3): 294-322(1986)
- Jai Menon:
A Study of Sort Algorithms for Multiprocessor Database Machines.
VLDB 1986: 197-206
- Lothar F. Mackert, Guy M. Lohman:
R* Optimizer Validation and Performance Evaluation for Distributed Queries.
VLDB 1986: 149-159
- David J. DeWitt, Robert H. Gerber, Goetz Graefe, Michael L. Heytens, Krishna B. Kumar, M. Muralikrishna:
GAMMA - A High Performance Dataflow Database Machine.
VLDB 1986: 228-237
- Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel, Jean-Marc Thévenin:
A Reliable Backend Using Multiattribute Clustering and Select-Join Operator.
VLDB 1986: 220-227
- Serge Abiteboul, Michel Scholl, Georges Gardarin, Eric Simon:
Towards DBMSs for Supporting New Applications.
VLDB 1986: 423-435
- Tobin J. Lehman, Michael J. Carey:
Query Processing in Main Memory Database Management Systems.
SIGMOD Conference 1986: 239-250
- Alexis Koster, Norman Sondak, Paul Sullivan:
The Application of a Geometric Arithmetic Parallel Systolic Array Processor to Database Machine Design.
ICDE 1986: 343-351
- Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel:
An Extension of Access Paths to Improve Joins and Selections.
ICDE 1986: 270-280
- David J. DeWitt, Robert H. Gerber:
Multiprocessor Hash-Based Join Algorithms.
VLDB 1985: 151-164
- Matthias Jarke, Jürgen Koch:
Query Optimization in Database Systems.
ACM Comput. Surv. 16(2): 111-152(1984)
- Kjell Bratbergsengen:
Hashing Methods and Relational Algebra Operations.
VLDB 1984: 323-333
- Patrick Valduriez, Yann Viémont:
A Multikey Hashing Scheme Using Predicate Trees.
SIGMOD Conference 1984: 107-114
- Eric Simon, Patrick Valduriez:
Design and Implementation of an Extendible Integrity Subsystem.
SIGMOD Conference 1984: 9-17
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:54 2008