Join Processing in Relational Databases.

@article{DBLP:journals/csur/MishraE92,
  author    = {Priti Mishra and
               Margaret H. Eich},
  title     = {Join Processing in Relational Databases},
  journal   = {ACM Comput. Surv.},
  volume    = {24},
  number    = {1},
  year      = {1992},
  pages     = {63-113},
  ee        = {db/journals/csur/MishraE92.html, db/journals/csur/PitouraBE95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1992 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.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An4-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition: ACM Digital Library

References

[Agrawal et al. 1989]

Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Composition of Database Relations. ICDE 1989: 102-108 BibTeX

[Aho et al. 1979]

Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314(1979) BibTeX

[Atkinson et al. 1989]

Malcolm P. Atkinson, François Bancilhon, David J. DeWitt, Klaus R. Dittrich, David Maier, Stanley B. Zdonik: The Object-Oriented Database System Manifesto. DOOD 1989: 223-240 BibTeX

[Baba et al. 1987]

Takanobu Baba, Hideki Saito, S. Bing Yao: A Network Algorithm for Relational Database Operations. IWDM 1987: 202-215 BibTeX

[Babb 1979]

Edward Babb: Implementing a Relational Database by Means of Specialized Hardware. ACM Trans. Database Syst. 4(1): 1-29(1979) BibTeX

[Bancilhon et al. 1983]

...

[Banyopadhyay and Sengupta 1988]

Subir Bandyopadhyay, Abhijit Sengupta: A Robust Protocol for Parallel Join Operation in Distributed Data Bases. DPDS 1988: 97-106 BibTeX

[Banerjee et al. 1988]

Jay Banerjee, Won Kim, Kyung-Chang Kim: Queries in Object-Oriented Databases. ICDE 1988: 31-38 BibTeX

[Baru and Frieder 1989]

Chaitanya K. Baru, Ophir Frieder: Database Operations in a Cube-Connected Multicomputer System. IEEE Trans. Computers 38(6): 920-927(1989) BibTeX

[Baru et al. 1987]

Chaitanya K. Baru, Ophir Frieder, Dilip D. Kandlur, Mark E. Segal: Join on a Cube: Analysis, Simulation, and Implementation. IWDM 1987: 61-74 BibTeX

[Beeri and Vardi 1981]

Catriel Beeri, Moshe Y. Vardi: On the Properties of Join Dependencies. Advances in Data Base Theory 1979: 25-71 BibTeX

[Bell et al. 1989]

David A. Bell, D. H. O. Ling, Sally I. McClean: Pragmatic Estimation of Join Sizes and Attribute Correlations. ICDE 1989: 76-84 BibTeX

[Bentley 1975]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX

[Bentley 1979]

Jon Louis Bentley: Multidimensional Binary Search Trees in Database Applications. IEEE Trans. Software Eng. 5(4): 333-340(1979) BibTeX

[Bentley and Kung 1979]

...

[Bernstein and Chiu 1981]

Philip A. Bernstein, Dah-Ming W. Chiu: Using Semi-Joins to Solve Relational Queries. J. ACM 28(1): 25-40(1981) BibTeX

[Bernstein and Goodman 1979a]

...

[Bernstein and Goodman 1979b]

...

[Bernstein and Goodman 1980]

Philip A. Bernstein, Nathan Goodman: The power of inequality semijoins. Inf. Syst. 6(4): 255-265(1981) BibTeX

[Bertino and Kim 1989]

Elisa Bertino, Won Kim: Indexing Techniques for Queries on Nested Objects. IEEE Trans. Knowl. Data Eng. 1(2): 196-214(1989) BibTeX

[Bitton et al. 1987]

Dina Bitton, Maria Hanrahan, Carolyn Turbyfill: Performance of Complex Queries in Main Memory Database Systems. ICDE 1987: 72-81 BibTeX

[Bitton et al. 1983]

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

[Blasgen and Eswaran 1977]

Mike W. Blasgen, Kapali P. Eswaran: Storage and Access in Relational Data Bases. IBM Systems Journal 16(4): 362-377(1977) BibTeX

[Bloom 1970]

Burton H. Bloom: Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM 13(7): 422-426(1970) BibTeX

[Bratbergsengen 1984]

Kjell Bratbergsengen: Hashing Methods and Relational Algebra Operations. VLDB 1984: 323-333 BibTeX

[Britton Lee, Inc 1981]

...

[Cammarata et al. 1989]

Stephanie J. Cammarata, Prasadram Ramachandra, Darrell Shane: Extendeing a Relational Database with Deferred Referential Integrity Checking and Intelligent Joins. SIGMOD Conference 1989: 88-97 BibTeX

[Carey et al. 1990]

Michael J. Carey, Eugene J. Shekita, George Lapis, Bruce G. Lindsay, John McPherson: An Incremental Join Attachment for Starburst. VLDB 1990: 662-673 BibTeX

[Ceri et al. 1986]

Stefano Ceri, Georg Gottlob, Giuseppe Pelagatti: Taxonomy and formal properties of distributed joins. Inf. Syst. 11(1): 25-40(1986) BibTeX

[Chang and Fu 1980]

Jo-Mei Chang, King-sun Fu: A Dynamic Clustering Technique for Physical Database Design. SIGMOD Conference 1980: 188-199 BibTeX

[Cheiney et al. 1986]

Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel: An Extension of Access Paths to Improve Joins and Selections. ICDE 1986: 270-280 BibTeX

[Chen and Li 1989]

Jason S. J. Chen, Victor O. K. Li: Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network. IEEE Trans. Software Eng. 15(1): 26-38(1989) BibTeX

[Christodoulakis 1985]

Stavros Christodoulakis: Estimating Block Transfers and Join Sizes. SIGMOD Conference 1983: 40-54 BibTeX

[Codd 1970]

E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX

[Codd 1972]

E. F. Codd: Relational Completeness of Data Base Sublanguages. In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972) BibTeX

[Cornell and Yu 1988]

Douglas W. Cornell, Philip S. Yu: Site Assignment for Relations and Join Operations in the Distributed Transaction Processing Environment. ICDE 1988: 100-108 BibTeX

[Dale et al. 1989]

...

[Date 1983]

C. J. Date: The Outer Join. ICOD 1983: 76-106 BibTeX

[Dayal 1985]

Umeshwar Dayal: Query Processing in a Multidatabase System. Query Processing in Database Systems 1985: 81-108 BibTeX

[Desai 1989]

Bipin C. Desai: Performance of a Composite Attribute and Join Index. IEEE Trans. Software Eng. 15(2): 142-152(1989) BibTeX

[Desai 1990]

...

[Deshpande et al. 1990]

...

[DeWitt and Gerber 1985]

David J. DeWitt, Robert H. Gerber: Multiprocessor Hash-Based Join Algorithms. VLDB 1985: 151-164 BibTeX

[DeWitt and Gray 1990]

David J. DeWitt, Jim Gray: Parallel Database Systems: The Future of Database Processing or a Passing Fad? SIGMOD Record 19(4): 104-112(1990) BibTeX

[DeWitt et al. 1984]

David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood: Implementation Techniques for Main Memory Database Systems. SIGMOD Conference 1984: 1-8 BibTeX

[Dutka and Hanson 1989]

...

[Ehrensberger 1984]

...

[El-Masri and Navathe 1989]

Ramez Elmasri, Shamkant B. Navathe: Fundamentals of Database Systems. Benjamin/Cummings 1989
BibTeX

[El-Masri et al. 1990]

Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim: The Time Index: An Access Structure for Temporal Data. VLDB 1990: 1-12 BibTeX

[Epstein and Stonebraker 1980]

Robert S. Epstein, Michael Stonebraker: Analysis of Distributed Data Base Processing Strategies. VLDB 1980: 92-101 BibTeX

[Epstein 1982]

...

[Fagin 1979]

Ronald Fagin: Normal Forms and Relational Database Operators. SIGMOD Conference 1979: 153-160 BibTeX

[Fotouhi and Pramanik 1989]

Farshad Fotouhi, Sakti Pramanik: Optimal Secondary Storage Access Sequence for Performing Relational Join. IEEE Trans. Knowl. Data Eng. 1(3): 318-328(1989) BibTeX

[Fushimi et al. 1985]

Shinya Fushimi, Masaru Kitsuregawa, Masaya Nakayama, Hidehiko Tanaka, Tohru Moto-Oka: Algorithm and Performance Evaluation of Adaptive Multidimensional Clustering Technique. SIGMOD Conference 1985: 308-318 BibTeX

[Gardarin and Valduriez 1989]

Georges Gardarin, Patrick Valduriez: Relational Databases and Knowledge Bases. Addison-Wesley 1989, ISBN 0-201-09955-1
BibTeX

[Gerber 1986]

...

[Ghandeharizadeh and DeWitt 1990]

Shahram Ghandeharizadeh, David J. DeWitt: Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines. VLDB 1990: 481-492 BibTeX

[Goodman 1981]

...

[Gouda and Dayal 1981]

Mohamed G. Gouda, Umeshwar Dayal: Optimal Semijoin Schedules For Query Processing in Local Distributed Database Systems. SIGMOD Conference 1981: 164-175 BibTeX

[Goyal et al. 1988]

Pankaj Goyal, H. F. Li, E. Regener, Fereidoon Sadri: Scheduling of Page Fetches in Join Operations Using Bc-Trees. ICDE 1988: 304-310 BibTeX

[Graefe 1989]

Goetz Graefe: Relational Division: Four Algorithms and Their Performance. ICDE 1989: 94-101 BibTeX

[Gyssens 1986]

Marc Gyssens: On the Complexity of Join Dependencies. ACM Trans. Database Syst. 11(1): 81-108(1986) BibTeX

[Hagmann 1986]

Robert B. Hagmann: An Observation on Database Buffering Performance Metrics. VLDB 1986: 289-293 BibTeX

[Harada et al. 1990]

Lilian Harada, Miyuki Nakano, Masaru Kitsuregawa, Mikio Takagi: Query Processing for Multi-Attribute Clustered Records. VLDB 1990: 59-70 BibTeX

[Harbron 1988]

...

[Held and Carlis 1987]

James P. Held, John V. Carlis: MATCH - A New High-Level Relational Operator For Pattern Matching. Commun. ACM 30(1): 62-75(1987) BibTeX

[Hsiao 1980]

...

[Hua and Lee 1990]

Kien A. Hua, Chiang Lee: An Adaptive Data Placement Scheme for Parallel Database Computer Systems. VLDB 1990: 493-506 BibTeX

[Hursch 1989]

...

[Hurson 1981]

...

[Hurson 1986]

...

[Hurson et al. 1989]

...

[IBM 1978]

...

[Intel Corporation]

...

[Ioannidis and Kang 1990]

Yannis E. Ioannidis, Younkyung Cha Kang: Randomized Algorithms for Optimizing Large Join Queries. SIGMOD Conference 1990: 312-321 BibTeX

[Kambayashi 1985]

Yahiko Kambayashi: Processing Cyclic Queries. Query Processing in Database Systems 1985: 62-78 BibTeX

[Kang and Roussopoulos 1987a]

Hyunchul Kang, Nick Roussopoulos: Using 2-way Semijoins in Distributed Query Processing. ICDE 1987: 644-651 BibTeX

[Kang and Roussopoulos 1987b]

...

[Kent 1983]

William Kent: A Simple Guide to Five Normal Forms in Relational Database Theory. Commun. ACM 26(2): 120-125(1983) BibTeX

[Kim 1980]

Won Kim: A New Way to Compute the Product and Join of Relations. SIGMOD Conference 1980: 179-187 BibTeX

[Kim 1989]

Won Kim: A Model of Queries for Object-Oriented Databases. VLDB 1989: 423-432 BibTeX

[Kim et al. 1985]

Won Kim, David S. Reiner, Don S. Batory (Eds.): Query Processing in Database Systems. Springer 1985, ISBN 3-540-13831-5
Contents BibTeX

[Kitsuregawa et al. 1983]

Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka: Application of Hash to Data Base Machine and Its Architecture. New Generation Comput. 1(1): 63-74(1983) BibTeX

[Kitsuregawa et al. 1989a]

Masaru Kitsuregawa, Miyuki Nakano, Mikio Takagi: Query Execution for Large Relations on Functional Disk Systems. ICDE 1989: 159-167 BibTeX

[Kitsuregawa et al. 1989b]

Masaru Kitsuregawa, Lilian Harada, Mikio Takagi: Join Strategies on KB-Tree Indexed Relations. ICDE 1989: 85-93 BibTeX

[Kitsuregawa et al. 1989c]

Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi: The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method. VLDB 1989: 257-266 BibTeX

[Kitsuregawa and Ogawa 1990]

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 BibTeX

[Kumar and Stonebraker 1987]

Akhil Kumar, Michael Stonebraker: The Effect of Join Selectivities on Optimal Nesting Order. SIGMOD Record 16(1): 28-41(1987) BibTeX

[Kung and Lehman 1980]

H. T. Kung, Philip L. Lehman: Systolic (VLSI) Arrays for Relational Database Operations. SIGMOD Conference 1980: 105-116 BibTeX

[Lakshmi and Yu 1988]

M. Seetha Lakshmi, Philip S. Yu: Effect of Skew on Join Performance in Parallel Architectures. DPDS 1988: 107-120 BibTeX

[Lakshmi and Yu 1989]

M. Seetha Lakshmi, Philip S. Yu: Limiting Factors of Join Performance on Parallel Processors. ICDE 1989: 488-496 BibTeX

[Lakshmi and Yu 1990]

M. Seetha Lakshmi, Philip S. Yu: Effectiveness of Parallel Joins. IEEE Trans. Knowl. Data Eng. 2(4): 410-424(1990) BibTeX

[Lehman and Carey 1986]

Tobin J. Lehman, Michael J. Carey: Query Processing in Main Memory Database Management Systems. SIGMOD Conference 1986: 239-250 BibTeX

[Lipton et al. 1990]

Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider: Practical Selectivity Estimation through Adaptive Sampling. SIGMOD Conference 1990: 1-11 BibTeX

[Lu and Carey 1985]

Hongjun Lu, Michael J. Carey: Some Experimental Results on Distributed Join Algorithms in a Local Network. VLDB 1985: 292-304 BibTeX

[Mackert and Lohman 1986]

Lothar F. Mackert, Guy M. Lohman: R* Optimizer Validation and Performance Evaluation for Distributed Queries. VLDB 1986: 149-159 BibTeX

[Maier 1983]

David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX

[Masuyama et al. 1987]

Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa: Shortest Semijoin Schedule for a Local Area Distributed Database System. IEEE Trans. Software Eng. 13(5): 602-606(1987) BibTeX

[Menezes et al. 1987]

Bernard L. Menezes, K. Thadani, Alfred G. Dale, Roy M. Jenevein: Design of a HyperKYKLOS-based Multiprocessor Architecture for High-Performance Join Operations. IWDM 1987: 75-88 BibTeX

[Mikkilineni and Su 1988]

Krishna P. Mikkilineni, Stanley Y. W. Su: An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment. IEEE Trans. Software Eng. 14(6): 838-848(1988) BibTeX

[Mullin 1990]

James K. Mullin: Optimal Semijoins for Distributed Database Systems. IEEE Trans. Software Eng. 16(5): 558-560(1990) BibTeX

[Murphy and Rotem 1989a]

Marguerite C. Murphy, Doron Rotem: Effective Resource Utilization for Multiprocessor Join Execution. VLDB 1989: 67-75 BibTeX

[Murphy and Rotem 1989b]

Marguerite C. Murphy, Doron Rotem: Processor Scheduling for Multiprocessor Joins. ICDE 1989: 140-148 BibTeX

[Nakayama et al. 1984]

T. Nakayama, Masahito Hirakawa, Tadao Ichikawa: Architecture and Algorithm for Parallel Execution of a Join Operation. ICDE 1984: 160-166 BibTeX

[Nakayama et al. 1988]

Masaya Nakayama, Masaru Kitsuregawa, Mikio Takagi: Hash-Partitioned Join Method Using Dynamic Destaging Strategy. VLDB 1988: 468-478 BibTeX

[Omiecinski 1989]

Edward Omiecinski: Heuristics for Join Processing Using Nonclustered Indexes. IEEE Trans. Software Eng. 15(1): 18-25(1989) BibTeX

[Omiecinski and Shonkwiler 1990]

...

[Osborn and Heaven 1986]

Sylvia L. Osborn, T. E. Heaven: The Design of a Relational Database System with Abstract Data Types for Domains. ACM Trans. Database Syst. 11(3): 357-373(1986) BibTeX

[Ozkarahan 1986]

...

[Ozkarahan and Bozsahin 1988]

Esen A. Ozkarahan, Cem H. Bozsahin: Join Strategies Using Data Space Partitioning. New Generation Comput. 6(1): 19-39(1988) BibTeX

[Ozsoyoglu et al. 1989]

Gultekin Özsoyoglu, Victor Matos, Z. Meral Özsoyoglu: Query Processing Techniques in the Summary-Table-by-Example Database Query Language. ACM Trans. Database Syst. 14(4): 526-573(1989) BibTeX

[Perrizo et al. 1989]

William Perrizo, Jonathan Y. Y. Lin, Wherly Hoffman: Algorithms for Distributed Query Processing in Broadcast Local Area Networks. IEEE Trans. Knowl. Data Eng. 1(2): 215-225(1989) BibTeX

[Piatetsky-Shapiro and Connell 1984]

Gregory Piatetsky-Shapiro, Charles Connell: Accurate Estimation of the Number of Tuples Satisfying a Condition. SIGMOD Conference 1984: 256-276 BibTeX

[Pramanik 1986]

Sakti Pramanik: Performance Analysis of a Database Filter Search Hardware. IEEE Trans. Computers 35(12): 1077-1082(1986) BibTeX

[Pramanik and Fotouhi 1985]

...

[Pramanik and Ittner 1985]

Sakti Pramanik, David Ittner: Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join. ACM Trans. Database Syst. 10(1): 57-74(1985) BibTeX

[Pramanik and Vineyard 1988]

Sakti Pramanik, David Vineyard: Optimizing Join Queries in Distributed Databases. IEEE Trans. Software Eng. 14(9): 1319-1326(1988) BibTeX

[Pucheral et al. 1990]

Philippe Pucheral, Jean-Marc Thévenin, Patrick Valduriez: Efficient Main Memory Data Management Using the DBGraph Storage Model. VLDB 1990: 683-695 BibTeX

[Raschid et al.1986]

Louiqa Raschid, Tinghe Fei, Herman Lam, Stanley Y. W. Su: A Special-Function Unit for Sorting and Sort-Based Database Operations. IEEE Trans. Computers 35(12): 1071-1077(1986) BibTeX

[Richardson et al. 1987]

James P. Richardson, Hongjun Lu, Krishna P. Mikkilineni: Design and Evaluation of Parallel Pipelined Join Algorithms. SIGMOD Conference 1987: 399-409 BibTeX

[Robinson 1981]

John T. Robinson: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. SIGMOD Conference 1981: 10-18 BibTeX

[Rosenthal and Galindo-Legaria 1990]

Arnon Rosenthal, César A. Galindo-Legaria: Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins. SIGMOD Conference 1990: 291-299 BibTeX

[Rosenthal and Reiner 1984]

Arnon Rosenthal, David S. Reiner: Extending the Algebraic Framework of Query Processing to Handle Outerjoins. VLDB 1984: 334-343 BibTeX

[Rudolph 1972a]

...

[Sacco 1984]

Giovanni Maria Sacco: Distributed Query Evaluation in Local Area Networks. ICDE 1984: 510-516 BibTeX

[Sacco and Schkolnick 1986]

Giovanni Maria Sacco, Mario Schkolnick: Buffer Management in Relational Database Systems. ACM Trans. Database Syst. 11(4): 473-498(1986) BibTeX

[Sakai et al. 1984]

Hiroshi Sakai, Kazuhide Iwata, Shigeo Kamiya, Masaaki Abe, Akio Tanaka, Shigeki Shibayama, Kunio Murakami: Design and Implementation of the Relational Datbase Engine. FGCS 1984: 419-426 BibTeX

[Schneider and DeWitt 1989]

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 BibTeX

[Segev 1986]

Arie Segev: Optimization of Join Operations in Horizontally Partitioned Database Systems. ACM Trans. Database Syst. 11(1): 48-80(1986) BibTeX

[Selinger et al. 1979]

Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price: Access Path Selection in a Relational Database Management System. SIGMOD Conference 1979: 23-34 BibTeX

[Shapiro 1986]

Leonard D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM Trans. Database Syst. 11(3): 239-264(1986) BibTeX

[Shekita and Carey 1990]

Eugene J. Shekita, Michael J. Carey: A Performance Evaluation of Pointer-Based Joins. SIGMOD Conference 1990: 300-311 BibTeX

[Stonebraker and Rowe 1986]

...

[Su 1988]

...

[Swami and Gupta 1988]

Arun N. Swami, Anoop Gupta: Optimization of Large Join Queries. SIGMOD Conference 1988: 8-17 BibTeX

[Tandem Database Group 1987]

Tandem Database Group - NonStop SQL: A Distributed, High-Performance, High-Availability Implementation of SQL. HPTS 1987: 60-104 BibTeX

[Tong and Yao 1982]

...

[Ullman 1988]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[Valduriez 1982]

...

[Valduriez 1986]

Patrick Valduriez: Optimization of Complex Database Queries Using Join Indices. IEEE Database Eng. Bull. 9(4): 10-16(1986) BibTeX

[Valduriez 1987]

Patrick Valduriez: Join Indices. ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX

[Valduriez and Boral 1986]

Patrick Valduriez, Haran Boral: Evaluation of Recursive Queries Using Join Indices. Expert Database Conf. 1986: 271-293 BibTeX

[Valduriez and Gardarin 1982]

Patrick Valduriez, Georges Gardarin: Multiprocessor Join Algorithms of Relations. JCDKB 1982: 219-236 BibTeX

[Valduriez and Gardarin 1984]

Patrick Valduriez, Georges Gardarin: Join and Semijoin Algorithms for a Multiprocessor Database Machine. ACM Trans. Database Syst. 9(1): 133-161(1984) BibTeX

[Valduriez and Viemont 1984]

Patrick Valduriez, Yann Viémont: A Multikey Hashing Scheme Using Predicate Trees. SIGMOD Conference 1984: 107-114 BibTeX

[Valduriez et al. 1986]

Patrick Valduriez, Setrag Khoshafian, George P. Copeland: Implementation Techniques of Complex Objects. VLDB 1986: 101-110 BibTeX

[Walton 1989]

...

[Wang and Luk 1988]

Xiao Wang, W. S. Luk: Parallel Join Algorithms on a Network of Workstations. DPDS 1988: 87-95 BibTeX

[Whang et al. 1985]

Kyu-Young Whang, Gio Wiederhold, Daniel Sagalowicz: The Property of Separability And Its Application to Physical Database Design. Query Processing in Database Systems 1985: 297-317 BibTeX

[Yao et al. 1981]

S. Bing Yao, Fu Tong, You-Zhoa Sheng: The System Architecture of a Database Machine (DBM). IEEE Database Eng. Bull. 4(2): 53-62(1981) BibTeX

[Yoo and Lafortune 1989]

Hyuck Yoo, Stéphane Lafortune: An Intelligent Search Method for Query Optimization by Semijoins. IEEE Trans. Knowl. Data Eng. 1(2): 226-237(1989) BibTeX

[Yoshikawa adn Kambayashi 1984]

Masatoshi Yoshikawa, Yahiko Kambayashi: Processing Inequality Queries Based on Generalized Semi-Joins. VLDB 1984: 416-428 BibTeX

[Yu et al. 1985]

Clement T. Yu, Chin-Chen Chang, Marjorie Templeton, David Brill, Eric Lund: Query Processing in a Fragmented Relational Distributed System: Mermaid. IEEE Trans. Software Eng. 11(8): 795-810(1985) BibTeX

[Yu et al. 1987]

Clement T. Yu, Keh-Chang Guh, Weining Zhang, Marjorie Templeton, David Brill, Arbee L. P. Chen: Algorithms to Process Distributed Queries in Fast Local Networks. IEEE Trans. Computers 36(10): 1153-1164(1987) BibTeX

[Zeller and Gray 1990]

Hansjörg Zeller, Jim Gray: An Adaptive Hash Join Algorithm for Multiuser Environments. VLDB 1990: 186-197 BibTeX

[Bancilhon and Scholl 1980]

François Bancilhon, Michel Scholl: On Designing an I/O Processor for a Relational Data Base Machine. SIGMOD Conference 1980: 93-93g BibTeX

[Banerjee and Hsiao 1979]

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

[Brownsmith 1981]

...

[Brownsmith and Su 1980]

...

[Chase 1981]

Karen Chase: Join Graphs and Acyclic Database Schemes. VLDB 1981: 95-100 BibTeX

[Chiu and Ho 1980]

D. M. Chiu, Y. C. Ho: A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions. SIGMOD Conference 1980: 169-178 BibTeX

[Ciaccia and Scalas 1989]

Paolo Ciaccia, Maria Rita Scalas: Optimization Strategies for Relational Disjunctive Queries. IEEE Trans. Software Eng. 15(10): 1217-1235(1989) BibTeX

[Codd 1979]

E. F. Codd: Extending the Database Relational Model to Capture More Meaning. ACM Trans. Database Syst. 4(4): 397-434(1979) BibTeX

[DeWitt 1979]

David J. DeWitt: DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems. IEEE Trans. Computers 28(6): 395-406(1979) BibTeX

[DeWitt et al. 1991]

David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider: An Evaluation of Non-Equijoin Algorithms. VLDB 1991: 443-452 BibTeX

[Gardy and Puech 1989]

Danièle Gardy, Claude Puech: On the Effects of Join Operations on Relation Sizes. ACM Trans. Database Syst. 14(4): 574-603(1989) BibTeX

[Gotlieb 1975]

Leo R. Gotlieb: Computing Joins of Relations. SIGMOD Conference 1975: 55-63 BibTeX

[Graefe 1990]

Goetz Graefe: Encapsulation of Parallelism in the Volcano Query Processing System. SIGMOD Conference 1990: 102-111 BibTeX

[Graefe 1991]

Goetz Graefe: Heap-Filter Merge Join: A New Algorithm For Joining Medium-Size Inputs. IEEE Trans. Software Eng. 17(9): 979-982(1991) BibTeX

[Honeyman 1980]

Peter Honeyman: Extension Joins. VLDB 1980: 239-244 BibTeX

[Hong 1984]

Yang-Chang Hong: A Pipeline and Parallel Architecture for Supporting Database Management Systems. ICDE 1984: 152-159 BibTeX

[Kambayashi and Seo 1982]

...

[Keller 1985]

Arthur M. Keller: Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins. PODS 1985: 154-163 BibTeX

[Kent 1979]

William Kent: The Entity Join. VLDB 1979: 232-238 BibTeX

[Lacroix and Pirotte 1976]

...

[Lu et al. 1990]

Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan: Hash-Based Join Algorithms for Multiprocessor Computers. VLDB 1990: 198-209 BibTeX

[Maier et al. 1981]

David Maier, Yehoshua Sagiv, Mihalis Yannakakis: On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM 28(4): 680-695(1981) BibTeX

[Menon and Hsiao 1983]

...

[Merret 1983]

T. H. Merrett: Why Sort-Merge Gives the Best Implementation of the Natural Join. SIGMOD Record 13(2): 39-51(1983) BibTeX

[Merret 1984]

T. H. Merrett: Practical Hardware for Linear Execution of relational database Operations. SIGMOD Record 14(1): 39-44(1984) BibTeX

[Merrett et al. 1981]

T. H. Merrett, Yahiko Kambayashi, H. Yasuura: Scheduling of Page-Fetches in Join Operations. VLDB 1981: 488-498 BibTeX

[Omiecinski and Lin 1989]

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) BibTeX

[Ono and Lohman 1990]

Kiyoshi Ono, Guy M. Lohman: Measuring the Complexity of Join Enumeration in Query Optimization. VLDB 1990: 314-325 BibTeX

[Qadah 1984]

...

[Qadah 1985]

Ghassan Z. Qadah: The Equi-Join Operation on a Multiprocessor Database Machine: Algorithms and the Evaluation of their Performance. IWDM 1985: 35-67 BibTeX

[Qadah and Irani 1985]

Ghassan Z. Qadah, Keki B. Irani: A Database Machine for Very Large Relational Databases. IEEE Trans. Computers 34(11): 1015-1025(1985) BibTeX

[Qadah and Irani 1988]

Ghassan Z. Qadah, Keki B. Irani: The Join Alogorithms on a Shared-Memory Multiprocessor Database Machine. IEEE Trans. Software Eng. 14(11): 1668-1683(1988) BibTeX

[Rissanen 1979]

Jorma Rissanen: Theory of Relations for Databases - A Tutorial Survey. MFCS 1978: 536-551 BibTeX

[Rosenthal 1981]

Arnon Rosenthal: Note on the Expected Size of a Join. SIGMOD Record 11(4): 19-25(1981) BibTeX

[Schneider and DeWitt 1990]

Donovan A. Schneider, David J. DeWitt: Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines. VLDB 1990: 469-480 BibTeX

[Schuster et al. 1979]

Stewart A. Schuster, H. B. Nguyen, Esen A. Ozkarahan, Kenneth C. Smith: RAP.2 - An Associative Processor for Databases and Its Applications. IEEE Trans. Computers 28(6): 446-458(1979) BibTeX

[Sciore 1982]

Edward Sciore: A Complete Axiomatization of Full Join Dependencies. J. ACM 29(2): 373-393(1982) BibTeX

[Shaw et al. 1981]

David Elliot Shaw, Salvatore J. Stolfo, Hussein Ibrahim, Bruce Hillyer, Gio Wiederhold, J. A. Andrews: The NON-VON Database Machine: A Brief Overview. IEEE Database Eng. Bull. 4(2): 41-52(1981) BibTeX

[Schultz and Miller 1987]

Roger Shultz, Ila Miller: Tree Structured Multiple Processor Join Methods. ICDE 1987: 190-199 BibTeX

[Su et al. 1979]

Stanley Y. W. Su, Le Huu Nguyen, Ahmed Emam, G. Jack Lipovski: The Architectural Features and Implementation Techniques of the Multicell CASSM. IEEE Trans. Computers 28(6): 430-445(1979) BibTeX

[Thom et al. 1986]

James A. Thom, Kotagiri Ramamohanarao, Lee Naish: A Superjoin Algorithm for Deductive Databases. VLDB 1986: 189-196 BibTeX

[Vardi 1980]

...

[Vardi 1983]

Moshe Y. Vardi: Inferring Multivalued Dependencies From Functional and Join Dependencies. Acta Inf. 19: 305-324(1983) BibTeX

Referenced by

1. Jochen Van den Bercken, Martin Schneider, Bernhard Seeger: Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins. EDBT 2000: 495-509
2. Zhe Li, Kenneth A. Ross: Fast Joins Using Join Indices. VLDB J. 8(1): 1-24(1999)
3. Volker Markl, Martin Zirkel, Rudolf Bayer: Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm. ICDE 1999: 562-571
4. Sven Helmer, Till Westmann, Guido Moerkotte: Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships. VLDB 1998: 98-109
5. Oliver Günther, Vincent Oria, Philippe Picouet, Jean-Marc Saglio, Michel Scholl: Benchmarking Spatial Joins À La Carte. SSDBM 1998: 32-41
6. Yannis Theodoridis, Emmanuel Stefanakis, Timos K. Sellis: Cost Models for Join Queries in Spatial Databases. ICDE 1998: 476-483
7. Miyuki Nakano, Hiroomi Imai, Masaru Kitsuregawa: Performance Analysis of Parallel Hash Join Algorithms on a Distributed Shared Memory Machine: Implementation and Evaluation on HP Exemplar SPP 1600. ICDE 1998: 76-85
8. Michael Steinbrunn, Guido Moerkotte, Alfons Kemper: Heuristic and Randomized Optimization for the Join Ordering Problem. VLDB J. 6(3): 191-208(1997)
9. Laura M. Haas, Michael J. Carey, Miron Livny, Amit Shukla: Seeking the Truth About ad hoc Join Costs. VLDB J. 6(3): 241-256(1997)
10. 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)
11. Uday R. Kulkarni, Richard G. Ramirez: Independently Updated Views. IEEE Trans. Knowl. Data Eng. 9(5): 798-812(1997)
12. Chee Yong Chan, Beng Chin Ooi: Efficient Scheduling of Page Access in Index-Based Join Processing. IEEE Trans. Knowl. Data Eng. 9(6): 1005-1011(1997)
13. Sven Helmer, Guido Moerkotte: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. VLDB 1997: 386-395
14. Evan P. Harris, Kotagiri Ramamohanarao: Join Algorithm Costs Revisited. VLDB J. 5(1): 64-84(1996)
15. Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu: Optimization of Parallel Execution for Multi-Join Queries. IEEE Trans. Knowl. Data Eng. 8(3): 416-428(1996)
16. Wilburt Labio, Hector Garcia-Molina: Efficient Snapshot Differential Algorithms for Data Warehousing. VLDB 1996: 63-74
17. Ming-Ling Lo, Chinya V. Ravishankar: Spatial Hash-Joins. SIGMOD Conference 1996: 247-258
18. Ming-Ling Lo, Chinya V. Ravishankar: Towards Eliminating Random I/O in Hash Joins. ICDE 1996: 422-429
19. Isabelle Comyn-Wattiau, Jacky Akoka: Reverse Engineering of Relational Database Physical Schema. ER 1996: 372-391
20. Nadejda Biscondi, André Flory, Lionel Brunie: Parallel Databases: Structured Query Optimization. ADBIS 1996: 146-152
21. Hongjun Lu, Kian-Lee Tan: On Sort-Merge Algorithm for Band Joins. IEEE Trans. Knowl. Data Eng. 7(3): 508-510(1995)
22. 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)
23. M. G. Martynov: Spatial Joins and R-trees. ADBIS 1995: 295-304
24. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
25. Ophir Frieder, Chaitanya K. Baru: Site and Query Scheduling Policies in Multicomputer Database Systems. IEEE Trans. Knowl. Data Eng. 6(4): 609-619(1994)
26. Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: Multi-Step Processing of Spatial Joins. SIGMOD Conference 1994: 197-208
27. Michael D. Soo, Richard T. Snodgrass, Christian S. Jensen: Efficient Evaluation of the Valid-Time Natural Join. ICDE 1994: 282-292
28. Goetz Graefe: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2): 73-170(1993)
29. Ming-Syan Chen, Hui-I Hsiao, Philip S. Yu: Applying Hash Filters to Improving the Execution of Bushy Trees. VLDB 1993: 505-516
30. Ming-Ling Lo, Ming-Syan Chen, Chinya V. Ravishankar, Philip S. Yu: On Optimal Processor Allocation to Support Pipelined Hash Joins. SIGMOD Conference 1993: 69-78
31. Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger: Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference 1993: 237-246
32. Bennet Vance: An Abstract Object-Oriented Query Execution Language. DBPL 1993: 176-199
33. Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honesty C. Young: Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins. VLDB 1992: 15-26