Query Evaluation Techniques for Large Databases.

Goetz Graefe: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2): 73-170(1993)
  author    = {Goetz Graefe},
  title     = {Query Evaluation Techniques for Large Databases},
  journal   = {ACM Comput. Surv.},
  volume    = {25},
  number    = {2},
  year      = {1993},
  pages     = {73-170},
  ee        = {db/journals/csur/Graefe93.html},
  bibsource = {DBLP,}


Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate the problem: In order to manipulate large sets of complex objects as efficiently as today's database systems manipulate simple records, query-processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software.

This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and postrelational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set-matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.

Copyright © 1993 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

CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

Online Edition: ACM Digital Library

Citation Page


[Adam and Wortmann 1989]
Nabil R. Adam, John C. Wortmann: Security-Control Methods for Statistical Databases: A Comparative Study. ACM Comput. Surv. 21(4): 515-556(1989) BibTeX
[Ahn and Snodgrass 1988]
Ilsoo Ahn, Richard T. Snodgrass: Partitioned storage for temporal databases. Inf. Syst. 13(4): 369-391(1988) BibTeX
[Albert 1991]
Joseph Albert: Algebraic Properties of Bag Data Types. VLDB 1991: 211-219 BibTeX
[Analyti and Pramanik 1992]
Anastasia Analyti, Sakti Pramanik: Fast Search in Main Memory Databases. SIGMOD Conference 1992: 215-224 BibTeX
[Anderson et al. 1988]
[Antoshenkov 1993]
Gennady Antoshenkov: Dynamic Query Optimization in Rdb/VMS. ICDE 1993: 538-547 BibTeX
[Astrahan et al. 1976]
Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim Gray, Patricia P. Griffiths, W. Frank King III, Raymond A. Lorie, Paul R. McJones, James W. Mehl, Gianfranco R. Putzolu, Irving L. Traiger, Bradford W. Wade, Vera Watson: System R: Relational Approach to Database Management. ACM Trans. Database Syst. 1(2): 97-137(1976) BibTeX
[Astrahan et al. 1987]
Morton M. Astrahan, Mario Schkolnick, Kyu-Young Whang: Approximating the number of unique values of an attribute without sorting. Inf. Syst. 12(1): 11-15(1987) BibTeX
[Atkinson and Bunemann 1987]
Malcolm P. Atkinson, Peter Buneman: Types and Persistence in Database Programming Languages. ACM Comput. Surv. 19(2): 105-190(1987) BibTeX
[Babb 1982]
Edward Babb: Joined Normal Form: A Storage Encoding for Relational Databases. ACM Trans. Database Syst. 7(4): 588-614(1982) BibTeX
[Babb 1979]
Edward Babb: Implementing a Relational Database by Means of Specialized Hardware. ACM Trans. Database Syst. 4(1): 1-29(1979) BibTeX
[Baeza-Yates and Larson 1989]
Ricardo A. Baeza-Yates, Per-Åke Larson: Performance of B+-Trees with Partial Expansions. IEEE Trans. Knowl. Data Eng. 1(2): 248-257(1989) BibTeX
[Bancilhon and Ramakrishnan 1986]
François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52 BibTeX
[Barghouti and Kaiser 1991]
Naser S. Barghouti, Gail E. Kaiser: Concurrency Control in Advanced Database Applications. ACM Comput. Surv. 23(3): 269-317(1991) 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
[Batini et al. 1986]
Carlo Batini, Maurizio Lenzerini, Shamkant B. Navathe: A Comparative Analysis of Methodologies for Database Schema Integration. ACM Comput. Surv. 18(4): 323-364(1986) BibTeX
[Batory et al. 1988a]
Don S. Batory, J. R. Barnett, J. F. Garza, K. P. Smith, K. Tsukuda, B. C. Twichell, T. E. Wise: GENESIS: An Extensible Database Management System. IEEE Trans. Software Eng. 14(11): 1711-1730(1988) BibTeX
[Batory et al. 1988b]
Don S. Batory, T. Y. Leung, T. E. Wise: Implementation Concepts for an Extensible Data Model and Data Language. ACM Trans. Database Syst. 13(3): 231-262(1988) BibTeX
[Baugsto and Greipsland 1989]
Bjørn Arild W. Baugstø, Jarle Fredrik Greipsland: Parallel Sorting Methods for Large Data Volumes on a Hypercube Database Computer. IWDM 1989: 127-141 BibTeX
[Bayer and McCreighton 1972]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX
[Beck et al. 1988]
Micah Beck, Dina Bitton, W. Kevin Wilkinson: Sorting Large Files on a Backend Multiprocessor. IEEE Trans. Computers 37(7): 769-778(1988) BibTeX
[Becker et al. 1991]
Bruno Becker, Hans-Werner Six, Peter Widmayer: Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference 1991: 128-137 BibTeX
[Beckmann et al. 1990]
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331 BibTeX
[Bell et al. 1989]
Timothy C. Bell, Ian H. Witten, John G. Cleary: Modeling for Text Compression. ACM Comput. Surv. 21(4): 557-591(1989) BibTeX
[Bentley 1975]
Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX
[Bernstein and Goodman 1981]
Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX
[Bernstein et al. 1981]
Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie Jr.: Query Processing in a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 6(4): 602-625(1981) BibTeX
[Bernstein et al. 1987]
Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX
[Berra et al. 1987]
P. Bruce Berra, Soon Myoung Chung, Nabil I. Hachem: Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base. IEEE Computer 20(3): 25-32(1987) BibTeX
[Bertino 1991]
Elisa Bertino: An Indexing Technique for Object-Oriented Databases. ICDE 1991: 160-170 BibTeX
[Bertino 1990]
Elisa Bertino: Optimization of Queries using Nested Indices. EDBT 1990: 44-59 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
[Bhide 1988]
Anupam Bhide: An Analysis of Three Transaction Processing Architectures. VLDB 1988: 339-350 BibTeX
[Bhide and Stonebraker 1988]
Anupam Bhide, Michael Stonebraker: A Performance Comparison of Two Architectures for Fast Transaction Processing. ICDE 1988: 536-545 BibTeX
[Bitton and DeWitt 1983]
Dina Bitton, David J. DeWitt: Duplicate Record Elimination in Large Data Files. ACM Trans. Database Syst. 8(2): 255-265(1983) BibTeX
[Bitton-Friedland 1982]
[Bitton and Gray 1988]
Dina Bitton, Jim Gray: Disk Shadowing. VLDB 1988: 331-338 BibTeX
[Bitton et al. 1984]
Dina Bitton, David J. DeWitt, David K. Hsiao, Jai Menon: A Taxonomy of Parallel Sorting. ACM Comput. Surv. 16(3): 287-318(1984) 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
[Blakeley and Martin 1990]
José A. Blakeley, Nancy L. Martin: Join Index, Materialized View, and Hybrid-Hash Join: A Performance Analysis. ICDE 1990: 256-263 BibTeX
[Blakeley et al. 1989]
José A. Blakeley, Neil Coburn, Per-Åke Larson: Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates. ACM Trans. Database Syst. 14(3): 369-400(1989) 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
[Blasgen and Eswaran 1976]
[Bloom 1970]
Burton H. Bloom: Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM 13(7): 422-426(1970) BibTeX
[Boral 1988]
Haran Boral: Parallelism in Bubba. DPDS 1988: 68-71 BibTeX
[Boral and DeWitt 1983]
Haran Boral, David J. DeWitt: Database Machines: An Idea Whose Time Passed? A Critique of the Future of Database Machines. IWDM 1983: 166-187 BibTeX
[Boral et al. 1990]
Haran Boral, William Alexander, Larry Clay, George P. Copeland, Scott Danforth, Michael J. Franklin, Brian E. Hart, Marc G. Smith, Patrick Valduriez: Prototyping Bubba, A Highly Parallel Database System. IEEE Trans. Knowl. Data Eng. 2(1): 4-24(1990) BibTeX
[Bratbergsengen 1984]
Kjell Bratbergsengen: Hashing Methods and Relational Algebra Operations. VLDB 1984: 323-333 BibTeX
[Brown et al. 1992]
[Bucheral 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
[Buneman and Frankel 1979]
Peter Buneman, Robert E. Frankel: FQL - A Functional Query Language. SIGMOD Conference 1979: 52-58 BibTeX
[Buneman et al. 1982]
Peter Buneman, Robert E. Frankel, Rishiyur S. Nikhil: An Implementation Technique for Database Query Languages. ACM Trans. Database Syst. 7(2): 164-186(1982) BibTeX
[Cacace et al. 1992]
Filippo Cacace, Stefano Ceri, Maurice A. W. Houtsma: A Survey of Parallel Execution Strategies for Transitive Closure and Logic Programs. Distributed and Parallel Databases 1(4): 337-382(1993) BibTeX
[Carey et al. 1986]
Michael J. Carey, David J. DeWitt, Joel E. Richardson, Eugene J. Shekita: Object and File Management in the EXODUS Extensible Database System. VLDB 1986: 91-100 BibTeX
[Carlis 1986]
John V. Carlis: HAS, a Relational Algebra Operator or Divide is not Enough to Conquer. ICDE 1986: 254-261 BibTeX
[Carter and Wegman 1979]
Larry Carter, Mark N. Wegman: Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154(1979) BibTeX
[Chamberlin et al. 1981a]
Donald D. Chamberlin, Morton M. Astrahan, Mike W. Blasgen, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Patricia G. Selinger, Mario Schkolnick, Donald R. Slutz, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: A History and Evaluation of System R. Commun. ACM 24(10): 632-646(1981) BibTeX
[Chamberlin et al. 1981b]
Donald D. Chamberlin, Morton M. Astrahan, W. Frank King III, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, Bradford W. Wade, Robert A. Yost: Support for Repetitive Transactions and Ad Hoc Queries in System R. ACM Trans. Database Syst. 6(1): 70-94(1981) BibTeX
[Chen 1976]
Peter P. Chen: The Entity-Relationship Model - Toward a Unified View of Data. ACM Trans. Database Syst. 1(1): 9-36(1976) BibTeX
[Chen and Kuck 1984]
Huei-Huang Chen, Sharon McCure Kuck: Combining Relational and Network Retrieval Methods. SIGMOD Conference 1984: 131-142 BibTeX
[Chen et al. 1992]
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 BibTeX
[Cheng et al. 1991]
Josephine M. Cheng, Donald J. Haderle, Richard Hedges, Balakrishna R. Iyer, Ted Messinger, C. Mohan, Yun Wang: An Efficient Hybrid Join Algorithm: A DB2 Prototype. ICDE 1991: 171-180 BibTeX
[Cheriton et al. 1991]
David R. Cheriton, Hendrik A. Goosen, Patrick D. Boyle: Paradigm: A Highly Scalable Shared-Memory Multicomputer Architecture. IEEE Computer 24(2): 33-46(1991) 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
[Chou 1985]
[Chou and DeWitt 1985]
Hong-Tai Chou, David J. DeWitt: An Evaluation of Buffer Management Strategies for Relational Database Systems. VLDB 1985: 127-141 BibTeX
[Christodoulakis 1984]
Stavros Christodoulakis: Implications of Certain Assumptions in Database Performance Evaluation. ACM Trans. Database Syst. 9(2): 163-186(1984) BibTeX
[Chung and Berra 1988]
Soon Myoung Chung, P. Bruce Berra: A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases. EDBT 1988: 364-387 BibTeX
[Cluet et al. 1989]
Sophie Cluet, Claude Delobel, Christophe Lécluse, Philippe Richard: Reloop, an Algebra Based Query Language for an Object-Oriented Database System. DOOD 1989: 313-332 BibTeX
[Comer 1979]
Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
[Copeland et al. 1988]
George P. Copeland, William Alexander, Ellen E. Boughter, Tom W. Keller: Data Placement In Bubba. SIGMOD Conference 1988: 99-108 BibTeX
[Dadam et al. 1986]
Peter Dadam, Klaus Küspert, F. Andersen, Henk M. Blanken, R. Erbe, Jürgen Günauer, Vincent Y. Lum, Peter Pistor, Georg Walch: A DBMS Prototype to Support Extended NF2 Relations: An Integrated View on Flat Tables and Hierarchies. SIGMOD Conference 1986: 356-367 BibTeX
[Daniels and Ng 1982]
Dean Daniels, Pui Ng: Distributed Query Compilation and Processing in R*. IEEE Database Eng. Bull. 5(3): 15-18(1982) BibTeX
[Daniels et al. 1991]
Scott Daniels, Goetz Graefe, Thomas Keller, David Maier, Duri Schmidt, Bennet Vance: Query Optimization in Revelation, an Overview. IEEE Data Eng. Bull. 14(2): 58-62(1991) BibTeX
[Davidson et al. 1985]
Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985) BibTeX
[Davis 1992]
[Davison 1992]
Wayne Davison: Parallel Index Building in Informix OnLine 6.0. SIGMOD Conference 1992: 103 BibTeX
[Deppisch and Schek 1986]
Uwe Deppisch, H.-Bernhard Paul, Hans-Jörg Schek: A Storage System for Complex Objects. OODBS 1986: 183-195 BibTeX
[Deshpande and Larson 1991]
Vinay Deshpande, Per-Åke Larson: The Design and Implementation of a Parallel Join Algorithm for Nested Relations on Shared-Memory Multiprocessors. ICDE 1992: 68-77 BibTeX
[Deshpande and Larson 1991]
[Deshpande and van Gucht 1988]
Anand Deshpande, Dirk Van Gucht: An Implementation for Nested Relational Databases. VLDB 1988: 76-87 BibTeX
[DeWitt 1991]
David J. DeWitt: The Wisconsin Benchmark: Past, Present, and Future. The Benchmark Handbook 1991: 119-165 BibTeX
[DeWitt and Gerber 1985]
David J. DeWitt, Robert H. Gerber: Multiprocessor Hash-Based Join Algorithms. VLDB 1985: 151-164 BibTeX
[DeWitt and Gray 1992]
David J. DeWitt, Jim Gray: Parallel Database Systems: The Future of High Performance Database Systems. Commun. ACM 35(6): 85-98(1992) BibTeX
[DeWitt and Hawthorn 1981]
David J. DeWitt, Paula B. Hawthorn: A Performance Evaluation of Data Base Machine Architectures (Invited Paper). VLDB 1981: 199-214 BibTeX
[DeWitt et al. 1986]
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 BibTeX
[DeWitt et al. 1988]
David J. DeWitt, Shahram Ghandeharizadeh, Donovan A. Schneider: A Performance Analysis of the Gamma Database Machine. SIGMOD Conference 1988: 350-360 BibTeX
[DeWitt et al. 1990]
David J. DeWitt, Shahram Ghandeharizadeh, Donovan A. Schneider, Allan Bricker, Hui-I Hsiao, Rick Rasmussen: The Gamma Database Machine Project. IEEE Trans. Knowl. Data Eng. 2(1): 44-62(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
[DeWitt et al. 1993]
David J. DeWitt, Jeffrey F. Naughton, Joseph Burger: Nested Loops Revisited. PDIS 1993: 230-242 BibTeX
[DeWitt et al. 1991a]
David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider: An Evaluation of Non-Equijoin Algorithms. VLDB 1991: 443-452 BibTeX
[DeWitt et al. 1991b]
David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider: Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. PDIS 1991: 280-291 BibTeX
[Dozier 1992]
Jeff Dozier: Access to Data in NASA's Earth Observing System. SIGMOD Conference 1992: 1 BibTeX
[Effelsberg and Haerder 1984]
Wolfgang Effelsberg, Theo Härder: Principles of Database Buffer Management. ACM Trans. Database Syst. 9(4): 560-595(1984) BibTeX
[Enbody and Du 1988]
Richard J. Enbody, H. C. Du: Dynamic Hashing Schemes. ACM Comput. Surv. 20(2): 85-113(1988) BibTeX
[Englert et al. 1989]
Susanne Englert, Jim Gray, Terrye Kocher, Praful Shah: A Benchmark of NonStop SQL Release 2 Demonstrating Near-Linear Speedup and Scaleup on Large Databases. SIGMETRICS 1990: 245-246 BibTeX
[Epstein 1979]
[Epstein and Stonebraker 1980]
Robert S. Epstein, Michael Stonebraker: Analysis of Distributed Data Base Processing Strategies. VLDB 1980: 92-101 BibTeX
[Epstein et al. 1978]
Robert S. Epstein, Michael Stonebraker, Eugene Wong: Distributed Query Processing in a Relational Data Base System. SIGMOD Conference 1978: 169-180 BibTeX
[Fagin et al. 1979]
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979) BibTeX
[Faloutsos 1985]
Christos Faloutsos: Access Methods for Text. ACM Comput. Surv. 17(1): 49-74(1985) BibTeX
[Faloutsos and Sellis 1991]
Christos Faloutsos, Raymond T. Ng, Timos K. Sellis: Predictive Load Control for Flexible Buffer Allocation. VLDB 1991: 265-274 BibTeX
[Fang et al. 1986]
M. T. Fang, Richard C. T. Lee, Chin-Chen Chang: The Idea of De-Clustering and its Applications. VLDB 1986: 181-188 BibTeX
[Finkel and Bentley 1974]
Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9(1974) BibTeX
[Freytag and Goodman 1989]
Johann Christoph Freytag, Nathan Goodman: On the Translation of Relational Queries into Iterative Programs. ACM Trans. Database Syst. 14(1): 1-27(1989) BibTeX
[Fushimi et al. 1986]
Shinya Fushimi, Masaru Kitsuregawa, Hidehiko Tanaka: An Overview of The System Software of A Parallel Relational Database Machine GRACE. VLDB 1986: 209-219 BibTeX
[Gallaire et al. 1984]
Hervé Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. ACM Comput. Surv. 16(2): 153-185(1984) 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 and Woest 1988]
James R. Goodman, Philip J. Woest: The Wisconsin Multicube: A New Large-Scale Cache-Coherent Multiprocessor. ISCA 1988: 422-431 BibTeX
[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
[Graefe 1993a]
Goetz Graefe: Volcano - An Extensible and Parallel Query Evaluation System. IEEE Trans. Knowl. Data Eng. 6(1): 120-135(1994) BibTeX
[Graefe 1993b]
[Graefe 1993c]
Goetz Graefe: Sort-Merge-Join: An Idea Whose Time Has(h) Passed? ICDE 1994: 406-417 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
[Graefe 1990a]
[Graefe 1990b]
Goetz Graefe: Encapsulation of Parallelism in the Volcano Query Processing System. SIGMOD Conference 1990: 102-111 BibTeX
[Graefe 1989]
Goetz Graefe: Relational Division: Four Algorithms and Their Performance. ICDE 1989: 94-101 BibTeX
[Graefe and Cole 1993]
Goetz Graefe, Richard L. Cole: Fast Algorithms for Universal Quantification in Large Databases. ACM Trans. Database Syst. 20(2): 187-236(1995) BibTeX
[Graefe and Davison 1993]
Goetz Graefe, Diane L. Davison: Encapsulation of Parallelism and Architecture-Independence in Extensible Database Query Execution. IEEE Trans. Software Eng. 19(8): 749-764(1993) BibTeX
[Graefe and DeWitt 1987]
Goetz Graefe, David J. DeWitt: The EXODUS Optimizer Generator. SIGMOD Conference 1987: 160-172 BibTeX
[Graefe and Maier 1988]
Goetz Graefe, David Maier: Query Optimization in Object-Oriented Database Systems: A Prospectus. OODBS 1988: 358-363 BibTeX
[Graefe and McKenna 1993]
Goetz Graefe, William J. McKenna: The Volcano Optimizer Generator: Extensibility and Efficient Search. ICDE 1993: 209-218 BibTeX
[Graefe and Shapiro 1991]
[Graefe and Ward 1989]
Goetz Graefe, Karen Ward: Dynamic Query Evaluation Plans. SIGMOD Conference 1989: 358-366 BibTeX
[Graefe and Wolniewicz 1992]
Richard H. Wolniewicz, Goetz Graefe: Algebraic Optimization of Computations over Scientific Databases. IEEE Data Eng. Bull. 16(1): 48-51(1993) BibTeX
[Graefe et al. 1992]
Goetz Graefe, Richard L. Cole, Diane L. Davison, William J. McKenna, Richard H. Wolniewicz: Extensible Query Optimization and Parallel Execution in Volcano. Query Processing for Advanced Database Systems, Dagstuhl 1991: 305-335 BibTeX
[Graefe et al. 1993]
Goetz Graefe, Ann Linville, Leonard D. Shapiro: Sort versus Hash Revisited. IEEE Trans. Knowl. Data Eng. 6(6): 934-944(1994) BibTeX
[Gray 1990]
[Gray and Putzolo 1987]
Jim Gray, Gianfranco R. Putzolu: The 5 Minute Rule for Trading Memory for Disk Accesses and The 10 Byte Rule for Trading Memory for CPU Time. SIGMOD Conference 1987: 395-398 BibTeX
[Gray and Reuter 1991]
Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents BibTeX
[Gray et al. 1981]
Jim Gray, Paul R. McJones, Mike W. Blasgen, Bruce G. Lindsay, Raymond A. Lorie, Thomas G. Price, Gianfranco R. Putzolu, Irving L. Traiger: The Recovery Manager of the System R Database Manager. ACM Comput. Surv. 13(2): 223-243(1981) BibTeX
[Gruenwald and Eich 1991]
Le Gruenwald, Margaret H. Eich: MMDB Reload Algorithms. SIGMOD Conference 1991: 397-405 BibTeX
[Guenther and Bilmes 1991]
Oliver Günther, Jeff Bilmes: Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation. IEEE Trans. Knowl. Data Eng. 3(3): 342-356(1991) BibTeX
[Guibas and Sedgewick 1978]
Leonidas J. Guibas, Robert Sedgewick: A Dichromatic Framework for Balanced Trees. FOCS 1978: 8-21 BibTeX
[Gunadhi and Segev 1991]
Himawan Gunadhi, Arie Segev: Query Processing Algorithms for Temporal Intersection Joins. ICDE 1991: 336-344 BibTeX
[Gunadhi and Segev 1990]
Himawan Gunadhi, Arie Segev: A Framework for Query Optimization in Temporal Databases. SSDBM 1990: 131-147 BibTeX
[Gunther 1989]
Oliver Günther: The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases. ICDE 1989: 598-605 BibTeX
[Gunther and Wong 1987]
Oliver Günther, Eugene Wong: A Dual Space Representation for Geometric Data. VLDB 1987: 501-506 BibTeX
[Guo et al. 1991]
Mingsen Guo, Stanley Y. W. Su, Herman Lam: An Association Algebra For Processing Object-Oriented Databases. ICDE 1991: 23-32 BibTeX
[Guttman 1984]
Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 BibTeX
[Haas et al. 1990]
Laura M. Haas, Walter Chang, Guy M. Lohman, John McPherson, Paul F. Wilms, George Lapis, Bruce G. Lindsay, Hamid Pirahesh, Michael J. Carey, Eugene J. Shekita: Starburst Mid-Flight: As the Dust Clears. IEEE Trans. Knowl. Data Eng. 2(1): 143-160(1990) BibTeX
[Haas et al. 1989]
Laura M. Haas, Johann Christoph Freytag, Guy M. Lohman, Hamid Pirahesh: Extensible Query Processing in Starburst. SIGMOD Conference 1989: 377-388 BibTeX
[Haas et al. 1982]
Laura M. Haas, Patricia G. Selinger, Elisa Bertino, Dean Daniels, Bruce G. Lindsay, Guy M. Lohman, Yoshifumi Masunaga, C. Mohan, Pui Ng, Paul F. Wilms, Robert A. Yost: R*: A Research Project on Distributed Relational DBMS. IEEE Database Eng. Bull. 5(4): 28-32(1982) BibTeX
[Haerder and Reuter 1983]
Theo Härder, Andreas Reuter: Principles of Transaction-Oriented Database Recovery. ACM Comput. Surv. 15(4): 287-317(1983) BibTeX
[Hafez and Ozsoyoglu 1988]
Aladdin Hafez: Storage Structures for Nested Relations. IEEE Data Eng. Bull. 11(3): 31-38(1988) BibTeX
[Hagmann 1986]
Robert B. Hagmann: An Observation on Database Buffering Performance Metrics. VLDB 1986: 289-293 BibTeX
[Hamming 1977]
[Hanson 1987]
Eric N. Hanson: A Performance Analysis of View Materialization Strategies. SIGMOD Conference 1987: 440-453 BibTeX
[Henrich et al. 1989]
Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53 BibTeX
[Hoel and Samet 1992]
Erik G. Hoel, Hanan Samet: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. SIGMOD Conference 1992: 205-214 BibTeX
[Hong and Stonebraker 1993]
Wei Hong, Michael Stonebraker: Optimization of Parallel Query Execution Plans in XPRS. Distributed and Parallel Databases 1(1): 9-32(1993) BibTeX
[Hong and Stonebraker 1991]
Wei Hong, Michael Stonebraker: Optimization of Parallel Query Execution Plans in XPRS. PDIS 1991: 218-225 BibTeX
[Hou and Ozsoyoglu 1993]
Wen-Chi Hou, Gultekin Özsoyoglu: Processing Time-Constrained Aggregate Queries in CASE-DB. ACM Trans. Database Syst. 18(2): 224-261(1993) BibTeX
[Hou and Ozsoyoglu 1991]
Wen-Chi Hou, Gultekin Özsoyoglu: Statistical Estimators for Aggregate Relational Algebra Queries. ACM Trans. Database Syst. 16(4): 600-654(1991) BibTeX
[Hou et al. 1991]
Wen-Chi Hou, Gultekin Özsoyoglu, Erdogan Dogdu: Error-Constraint COUNT Query Evaluation in Relational Databases. SIGMOD Conference 1991: 278-287 BibTeX
[Hsiao and DeWitt 1990]
Hui-I Hsiao, David J. DeWitt: Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines. ICDE 1990: 456-465 BibTeX
[Hua and Lee 1991]
Kien A. Hua, Chiang Lee: Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning. VLDB 1991: 525-535 BibTeX
[Hua and Lee 1990]
Kien A. Hua, Chiang Lee: An Adaptive Data Placement Scheme for Parallel Database Computer Systems. VLDB 1990: 493-506 BibTeX
[Hudson and King 1989]
Scott E. Hudson, Roger King: Cactis: A Self-Adaptive, Concurrent Implementation of an Object-Oriented Database Management System. ACM Trans. Database Syst. 14(3): 291-321(1989) BibTeX
[Hull and King 1987]
Richard Hull, Roger King: Semantic Database Modeling: Survey, Applications, and Research Issues. ACM Comput. Surv. 19(3): 201-260(1987) BibTeX
[Hutflesz et al. 1990]
Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The R-File: An Efficient Access Structure for Proximity Queries. ICDE 1990: 372-379 BibTeX
[Hutflesz et al. 1988a]
Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988: 183-190 BibTeX
[Hutflesz et al. 1988b]
Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT 1988: 352-363 BibTeX
[Ioannidis and Christodoulakis 1991]
Yannis E. Ioannidis, Stavros Christodoulakis: On the Propagation of Errors in the Size of Join Results. SIGMOD Conference 1991: 268-277 BibTeX
[Iyer and Dias 1990]
Balakrishna R. Iyer, Daniel M. Dias: System Issues in Parallel Sorting for Database Systems. ICDE 1990: 246-255 BibTeX
[Jagadish 1991]
H. V. Jagadish: A Retrieval Technique for Similar Shapes. SIGMOD Conference 1991: 208-217 BibTeX
[Jarke and Koch 1984]
Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984) BibTeX
[Jarke and Vassiliou 1985]
Matthias Jarke, Yannis Vassiliou: A Framework for Choosing a Database Query Language. ACM Comput. Surv. 17(3): 313-340(1985) BibTeX
[Katz 1990]
Randy H. Katz: Towards a Unified Framework for Version Modeling in Engineering Databases. ACM Comput. Surv. 22(4): 375-408(1990) BibTeX
[Katz and Wong 1983]
Randy H. Katz, Eugene Wong: Resolving Conflicts in Global Storage Design through Replication. ACM Trans. Database Syst. 8(1): 110-135(1983) BibTeX
[Keller et al. 1991]
Thomas Keller, Goetz Graefe, David Maier: Efficient Assembly of Complex Objects. SIGMOD Conference 1991: 148-157 BibTeX
[Kemper and Moerkotte 1990a]
Alfons Kemper, Guido Moerkotte: Access Support in Object Bases. SIGMOD Conference 1990: 364-374 BibTeX
[Kemper and Moerkotte 1990b]
Alfons Kemper, Guido Moerkotte: Advanced Query Processing in Object Bases Using Access Support Relations. VLDB 1990: 290-301 BibTeX
[Kemper and Wallrath 1987]
Alfons Kemper, Mechtild Wallrath: An Analysis of Geometric Modeling in Database Systems. ACM Comput. Surv. 19(1): 47-91(1987) BibTeX
[Kemper et al. 1991]
Alfons Kemper, Christoph Kilger, Guido Moerkotte: Function Materialization in Object Bases. SIGMOD Conference 1991: 258-267 BibTeX
[Kernighan and Ritchie 1978]
Brian W. Kernighan, Dennis Ritchie: The C Programming Language. Prentice-Hall 1978, ISBN 0-13-110163-3
[Kim 1984]
Won Kim: Highly Available Systems for Database Applications. ACM Comput. Surv. 16(1): 71-98(1984) BibTeX
[Kim 1980]
Won Kim: A New Way to Compute the Product and Join of Relations. SIGMOD Conference 1980: 179-187 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
[Kitsuregawa et al. 1989a]
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 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. 1989b]
Masaru Kitsuregawa, Weikang Yang, Shinya Fushimi: Evaluation of 18-stage Pipeline Hardware Sorter. IWDM 1989: 142-155 BibTeX
[Klug 1982]
Anthony C. Klug: Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. J. ACM 29(3): 699-717(1982) BibTeX
[Knapp 1987]
Edgar Knapp: Deadlock Detection in Distributed Databases. ACM Comput. Surv. 19(4): 303-328(1987) BibTeX
[Knuth 1973]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[Kolovson and Stonebraker 1991]
Curtis P. Kolovson, Michael Stonebraker: Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data. SIGMOD Conference 1991: 138-147 BibTeX
[Kooi 1980]
Robert Kooi: The Optimization of Queries in Relational Databases. Ph.D. thesis, Case Western Reserve University 1980
[Kooi and Frankforth 1982]
Robert Kooi, Derek Frankforth: Query Optimization in INGRES. IEEE Database Eng. Bull. 5(3): 2-5(1982) BibTeX
[Kriegel and Seeger 1988]
Hans-Peter Kriegel, Bernhard Seeger: PLOP-Hashing: A Grid File without Directory. ICDE 1988: 369-376 BibTeX
[Kriegel and Seeger 1987]
Hans-Peter Kriegel, Bernhard Seeger: Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions. ICDE 1987: 10-17 BibTeX
[Krishnamurthy et al. 1986]
Ravi Krishnamurthy, Haran Boral, Carlo Zaniolo: Optimization of Nonrecursive Queries. VLDB 1986: 128-137 BibTeX
[Kuespert et al. 1989]
Klaus Küspert, Gunter Saake, Lutz Michael Wegner: Duplicate Detection and Deletion in the Extended NF² Data Model. FODO 1989: 83-100 BibTeX
[Kumar and Burger 1991]
Vijay Kumar, Albert Burger: Performance Measurement of Some Main Memory Database Recovery Algorithms. ICDE 1991: 436-443 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
[Lakshmi and Yu 1988]
M. Seetha Lakshmi, Philip S. Yu: Effect of Skew on Join Performance in Parallel Architectures. DPDS 1988: 107-120 BibTeX
[Lanka and Mays 1991]
Sitaram Lanka, Eric Mays: Fully Persistent B+-trees. SIGMOD Conference 1991: 426-435 BibTeX
[Larson 1981]
Per-Åke Larson: Analysis of Index-Sequential Files with Overflow Chaining. ACM Trans. Database Syst. 6(4): 671-680(1981) BibTeX
[Larson and Yang 1985]
Per-Åke Larson, H. Z. Yang: Computing Queries from Derived Relations. VLDB 1985: 259-269 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
[Lelewer and Hirschberg 1987]
Debra A. Lelewer, Daniel S. Hirschberg: Data Compression. ACM Comput. Surv. 19(3): 261-296(1987) BibTeX
[Leung and Muntz 1992]
T. Y. Cliff Leung, Richard R. Muntz: Temporal Query Processing and Optimization in Multiprocessor Database Machines. VLDB 1992: 383-394 BibTeX
[Leung and Muntz 1990]
T. Y. Cliff Leung, Richard R. Muntz: Query Processing for Temporal Databases. ICDE 1990: 200-208 BibTeX
[Li and Naughton 1988]
Kai Li, Jeffrey F. Naughton: Multiprocessor Main Memory Transaction Processing. DPDS 1988: 177-187 BibTeX
[Litwin 1980]
Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 BibTeX
[Litwin et al. 1990]
Witold Litwin, Leo Mark, Nick Roussopoulos: Interoperability of Multiple Autonomous Databases. ACM Comput. Surv. 22(3): 267-293(1990) BibTeX
[Lohman et al. 1985]
Guy M. Lohman, C. Mohan, Laura M. Haas, Dean Daniels, Bruce G. Lindsay, Patricia G. Selinger, Paul F. Wilms: Query Processing in R*. Query Processing in Database Systems 1985: 31-47 BibTeX
[Lomet 1992]
David B. Lomet: A Review of Recent Work on Multi-attribute Access Methods. SIGMOD Record 21(3): 56-63(1992) BibTeX
[Lomet and Salzberg 1990a]
David B. Lomet, Betty Salzberg: The Performance of a Multiversion Access Method. SIGMOD Conference 1990: 353-363 BibTeX
[Lomet and Salzberg 1990b]
David B. Lomet, Betty Salzberg: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM Trans. Database Syst. 15(4): 625-658(1990) BibTeX
[Lorie and Nilsson 1979]
Raymond A. Lorie, Jørgen Fischer Nilsson: An Access Specification Language for a Relational Data Base System. IBM Journal of Research and Development 23(3): 286-298(1979) BibTeX
[Lorie and Young 1989]
Raymond A. Lorie, Honesty C. Young: A Low Communication Sort Algorithm for a Parallel Database Machine. VLDB 1989: 125-134 BibTeX
[Lynch and Brownrigg 1981]
Clifford A. Lynch, E. B. Brownrigg: Application of Data Compression to a Large Bibliographic Data Base. VLDB 1981: 435-447 BibTeX
[Lyytinen 1987]
Kalle Lyytinen: Different Perspectives on Information Systems: Problems and Solutions. ACM Comput. Surv. 19(1): 5-46(1987) BibTeX
[Mackert and Lohman 1989]
Lothar F. Mackert, Guy M. Lohman: Index Scans Using a Finite LRU Buffer: A Validated I/O Model. ACM Trans. Database Syst. 14(3): 401-424(1989) BibTeX
[Maier 1983]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
[Maier and Stein 1986]
David Maier, Jacob Stein: Indexing in an Object-Oriented DBMS. OODBS 1986: 171-182 BibTeX
[Maier et al. 1992]
David Maier, Goetz Graefe, Leonard D. Shapiro, Scott Daniels, Thomas Keller, Bennet Vance: Issues in Distributed Object Assembly. IWDOM 1992: 165-181 BibTeX
[Mannino et al. 1988]
Michael V. Mannino, Paicheng Chu, Thomas Sager: Statistical Profile Estimation in Database Systems. ACM Comput. Surv. 20(3): 191-221(1988) BibTeX
[McKenzie and Snodgrass 1991]
L. Edwin McKenzie, Richard T. Snodgrass: Evaluation of Relational Algebras Incorporating the Time Dimension in Databases. ACM Comput. Surv. 23(4): 501-543(1991) BibTeX
[Medeiros and Tompa 1985]
Claudia Bauzer Medeiros, Frank Wm. Tompa: Understanding the Implications of View Update Policies. VLDB 1985: 316-323 BibTeX
[Menon 1986]
Jai Menon: A Study of Sort Algorithms for Multiprocessor Database Machines. VLDB 1986: 197-206 BibTeX
[Mishra and Eich 1992]
Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992) BibTeX
[Mitschang 1989]
Bernhard Mitschang: Extending the Relational Algebra to Capture Complex Objects. VLDB 1989: 297-305 BibTeX
[Mohan et al. 1990]
C. Mohan, Donald J. Haderle, Yun Wang, Josephine M. Cheng: Single Table Access Using Multiple Indexes: Optimization, Execution, and Concurrency Control Techniques. EDBT 1990: 29-43 BibTeX
[Motro 1989]
Amihai Motro: An Access Authorization Model for Relational Databases Based on Algebraic Manipulation of View Definitions. ICDE 1989: 339-347 BibTeX
[Mullin 1990]
James K. Mullin: Optimal Semijoins for Distributed Database Systems. IEEE Trans. Software Eng. 16(5): 558-560(1990) BibTeX
[Nakayama et al. 1988]
Masaya Nakayama, Masaru Kitsuregawa, Mikio Takagi: Hash-Partitioned Join Method Using Dynamic Destaging Strategy. VLDB 1988: 468-478 BibTeX
[Neches 1988]
[Neches 1984]
Philip M. Neches: Hardware Support for Advanced Data Management Systems. IEEE Computer 17(11): 29-40(1984) BibTeX
[Neugebauer 1991]
Leonore Neugebauer: Optimization and Evaluation of Database Queries Including Embedded Interpolation Procedures. SIGMOD Conference 1991: 118-127 BibTeX
[Ng et al. 1991]
Raymond T. Ng, Christos Faloutsos, Timos K. Sellis: Flexible Buffer Allocation Based on Marginal Gains. SIGMOD Conference 1991: 387-396 BibTeX
[Nievergelt et al. 1984]
Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984) BibTeX
[Nyberg et al. 1993]
Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, David B. Lomet: AlphaSort: A RISC Machine Sort. SIGMOD Conference 1994: 233-242 BibTeX
[Omiecinski 1991]
Edward Omiecinski: Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor. VLDB 1991: 375-385 BibTeX
[Omiecinski 1985]
Edward Omiecinski: Incremental File Reorganization Schemes. VLDB 1985: 346-357 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
[Ousterhout 1990]
John K. Ousterhout: Why Aren't Operating Systems Getting Faster As Fast as Hardware? USENIX Summer 1990: 247-256 BibTeX
[Ozsoyoglu and Wang 1992]
Z. Meral Özsoyoglu, Jian Wang: A Keying Method for a Nested Relational Database Management System. ICDE 1992: 438-446 BibTeX
[Ozsoyoglu et al. 1987]
Gultekin Özsoyoglu, Z. Meral Özsoyoglu, Victor Matos: Extending Relational Algebra and Relational Calculus with Set-Valued Attributes and Aggregate Functions. ACM Trans. Database Syst. 12(4): 566-592(1987) BibTeX
[Ozsu and Valduriez 1991a]
M. Tamer Özsu, Patrick Valduriez: Distributed Database Systems: Where Are We Now? IEEE Computer 24(8): 68-78(1991) BibTeX
[Ozsu and Valduriez 1991b]
M. Tamer Özsu, Patrick Valduriez: Principles of Distributed Database Systems. Prentice-Hall 1991, ISBN 0-13-715681-2
[Palmer and Zdonik 1991]
Mark Palmer, Stanley B. Zdonik: Fido: A Cache That Learns to Fetch. VLDB 1991: 255-264 BibTeX
[Peckham and Maryanski 1988]
Joan Peckham, Fred J. Maryanski: Semantic Data Models. ACM Comput. Surv. 20(3): 153-189(1988) BibTeX
[Pirahesh et al. 1990]
Hamid Pirahesh, C. Mohan, Josephine M. Cheng, T. S. Liu, Patricia G. Selinger: Parallelism in Relational Data Base Systems: Architectural Issues and Design Approaches. DPDS 1990: 4-29 BibTeX
[Qadah 1988]
Ghassan Z. Qadah: Filter-Based Join Algorithms on Uniprocessor and Distributed-Memory Multiprocessor Database Machines. EDBT 1988: 388-413 BibTeX
[Rew and Davis 1990]
[Richardson and Carey 1987]
Joel E. Richardson, Michael J. Carey: Programming Constructs for Database System Implementation in EXODUS. SIGMOD Conference 1987: 208-219 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 Reiner 1985]
Arnon Rosenthal, David S. Reiner: Querying Relational Views of Networks. Query Processing in Database Systems 1985: 109-124 BibTeX
[Rosenthal et al. 1991]
[Rotem and Segev 1987]
Doron Rotem, Arie Segev: Physical Organization of Temporal Data. ICDE 1987: 547-553 BibTeX
[Roth et al. 1988]
Mark A. Roth, Henry F. Korth, Abraham Silberschatz: Extended Algebra and Calculus for Nested Relational Databases. ACM Trans. Database Syst. 13(4): 389-417(1988) BibTeX
[Rothnie et al. 1980]
James B. Rothnie Jr., Philip A. Bernstein, Stephen Fox, Nathan Goodman, Michael Hammer, Terry 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
[Roussopoulos 1991]
Nick Roussopoulos: An Incremental Access Method for ViewCache: Concept, Algorithms, and Cost Analysis. ACM Trans. Database Syst. 16(3): 535-563(1991) BibTeX
[Roussopoulos 1991]
Nick Roussopoulos, Hyunchul Kang: A Pipeline N-way Join Algorithm Based on the 2-way Semijoin Program. IEEE Trans. Knowl. Data Eng. 3(4): 486-495(1991) BibTeX
[Ruth and Keutzer 1972]
[Saake et al. 1989]
Gunter Saake, Volker Linnemann, Peter Pistor, Lutz Michael Wegner: Sorting, Grouping and Duplicate Elimination in the Advanced Information Management Prototype. VLDB 1989: 307-316 BibTeX
[Sacco 1987]
Giovanni Maria Sacco: Index Access with a Finite Buffer. VLDB 1987: 301-309 BibTeX
[Sacco and Schkolnik 1986]
Giovanni Maria Sacco, Mario Schkolnick: Buffer Management in Relational Database Systems. ACM Trans. Database Syst. 11(4): 473-498(1986) BibTeX
[Sacco and Schkolnik 1982]
Giovanni Maria Sacco, Mario Schkolnick: A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model. VLDB 1982: 257-262 BibTeX
[Sacks-Davis and Ramamohanarao 1983]
Ron Sacks-Davis, Kotagiri Ramamohanarao: A two level superimposed coding scheme for partial match retrieval. Inf. Syst. 8(4): 273-289(1983) BibTeX
[Sacks-Davis et al. 1987]
Ron Sacks-Davis, Alan J. Kent, Kotagiri Ramamohanarao: Multikey Access Methods Based on Superimposed Coding Techniques. ACM Trans. Database Syst. 12(4): 655-696(1987) BibTeX
[Salzberg 1990]
Betty Salzberg: Merging Sorted Runs Using Large Main Memory. Acta Inf. 27(3): 195-215(1989) BibTeX
[Salzberg 1988]
Betty Salzberg: File Structures: An Analytic Approach. Prentice-Hall 1988, ISBN 0-13-314550-6
[Salzberg et al. 1990]
Betty Salzberg, Alex Tsukerman, Jim Gray, Michael Stewart, Susan Uren, Bonnie Vaughan: FastSort: A Distributed Single-Input Single-Output External Sort. SIGMOD Conference 1990: 94-101 BibTeX
[Samet 1984]
Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16(2): 187-260(1984) BibTeX
[Schek and Scholl 1986]
Hans-Jörg Schek, Marc H. Scholl: The relational model with relation-valued attributes. Inf. Syst. 11(2): 137-147(1986) BibTeX
[Schneider 1991]
[Schneider 1990]
[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
[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
[Scholl 1988]
[Scholl et al. 1987]
Marc H. Scholl, H.-Bernhard Paul, Hans-Jörg Schek: Supporting Flat Relations by a Nested Relational Kernel. VLDB 1987: 137-146 BibTeX
[Seeger and Larson 1991]
Bernhard Seeger, Per-Åke Larson: Multi-Disk B-trees. SIGMOD Conference 1991: 436-445 BibTeX
[Segev and Gunadhi 1989]
Arie Segev, Himawan Gunadhi: Event-Join Optimization in Temporal Relational Databases. VLDB 1989: 205-215 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
[Sellis 1987]
Timos K. Sellis: Efficiently Supporting Procedures in Relational Database Systems. SIGMOD Conference 1987: 278-291 BibTeX
[Seppi et al. 1989]
[Serlin 1991]
[Seshadri and Naughton 1992]
S. Seshadri, Jeffrey F. Naughton: Sampling Issues in Parallel Database Systems. EDBT 1992: 328-343 BibTeX
[Severance 1983]
Dennis G. Severance: A practitioner's guide to data base compression - Tutorial. Inf. Syst. 8(1): 51-62(1983) BibTeX
[Severance and Lohman 1976]
Dennis G. Severance, Guy M. Lohman: Differential Files: Their Application to the Maintenance of Large Databases. ACM Trans. Database Syst. 1(3): 256-267(1976) BibTeX
[Severance et al. 1990]
Charles Severance, Sakti Pramanik, P. Wolberg: Distributed Linear Hashing and Parallel Projection in Main Memory Databases. VLDB 1990: 674-682 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
[Shaw and Zdonik 1990]
Gail M. Shaw, Stanley B. Zdonik: A Query Algebra for Object-Oriented Databases. ICDE 1990: 154-162 BibTeX
[Shaw and Zdonik 1989a]
Gail M. Shaw, Stanley B. Zdonik: An Object-Oriented Query Algebra. IEEE Data Eng. Bull. 12(3): 29-36(1989) BibTeX
[Shaw and Zdonik 1989b]
Gail M. Shaw, Stanley B. Zdonik: An Object-Oriented Query Algebra. DBPL 1989: 103-112 BibTeX
[Shekita and Carey 1990]
Eugene J. Shekita, Michael J. Carey: A Performance Evaluation of Pointer-Based Joins. SIGMOD Conference 1990: 300-311 BibTeX
[Sherman and Brice 1976]
Stephen W. Sherman, Richard S. Brice: Performance of a Database Manager in a Virtual Memory System. ACM Trans. Database Syst. 1(4): 317-343(1976) BibTeX
[Sheth and Larson 1990]
Amit P. Sheth, James A. Larson: Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases. ACM Comput. Surv. 22(3): 183-236(1990) BibTeX
[Shipman 1981]
David W. Shipman: The Functional Data Model and the Data Language DAPLEX. ACM Trans. Database Syst. 6(1): 140-173(1981) BibTeX
[Sikeler 1988]
Andrea Sikeler: VAR-PAGE-LRU A Buffer Replacement Algorithm Supporting Different Page Sizes. EDBT 1988: 336-351 BibTeX
[Silberschatz et al. 1991]
Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman: Database Systems: Achievements and Opportunities. Commun. ACM 34(10): 110-120(1991) BibTeX
[Six and Widmayer 1988]
Hans-Werner Six, Peter Widmayer: Spatial Searching in Geometric Databases. ICDE 1988: 496-503 BibTeX
[Smith and Chang 1975]
John Miles Smith, Philip Yen-Tang Chang: Optimizing the Performance of a Relational Algebra Database Interface. Commun. ACM 18(10): 568-579(1975) BibTeX
[Snodgrass 1990]
Richard T. Snodgrass: Temporal Databases - Status and Research Directions. SIGMOD Record 19(4): 83-89(1990) BibTeX
[Sockut and Goldberg 1979]
Gary H. Sockut, Robert P. Goldberg: Database Reorganization - Principles and Practice. ACM Comput. Surv. 11(4): 371-395(1979) BibTeX
[Srinavasan and Carey 1992]
V. Srinivasan, Michael J. Carey: Performance of On-Line Index Construction Algorithms. EDBT 1992: 293-309 BibTeX
[Srinavasan and Carey 1991]
V. Srinivasan, Michael J. Carey: Performance of B-Tree Concurrency Algorithms. SIGMOD Conference 1991: 416-425 BibTeX
[Stamos and Young 1989]
[Stonebraker 1991]
Michael Stonebraker: Managing Persistent Objects in a Multi-Level Store. SIGMOD Conference 1991: 2-11 BibTeX
[Stonebraker 1987]
Michael Stonebraker: The Design of the POSTGRES Storage System. VLDB 1987: 289-300 BibTeX
[Stonebraker 1986a]
Michael Stonebraker: The Case for Shared Nothing. IEEE Database Eng. Bull. 9(1): 4-9(1986) BibTeX
[Stonebraker 1986b]
[Stonebraker 1981]
Michael Stonebraker: Operating System Support for Database Management. Commun. ACM 24(7): 412-418(1981) BibTeX
[Stonebraker 1975]
Michael Stonebraker: Implementation of Integrity Constraints and Views by Query Modification. SIGMOD Conference 1975: 65-78 BibTeX
[Stonebraker et al. ]
[Stonebraker et al. 1990a]
Michael Stonebraker, Anant Jhingran, Jeffrey Goh, Spyros Potamianos: On Rules, Procedures, Caching and Views in Data Base Systems. SIGMOD Conference 1990: 281-290 BibTeX
[Stonebraker et al. 1988b]
Michael Stonebraker, Randy H. Katz, David A. Patterson, John K. Ousterhout: The Design of XPRS. VLDB 1988: 318-330 BibTeX
[Stonebraker et al. 1990b]
Michael Stonebraker, Lawrence A. Rowe, Michael Hirohama: The Implementation of Postgres. IEEE Trans. Knowl. Data Eng. 2(1): 125-142(1990) BibTeX
[Straube and Ozsu 1989]
[Su 1988]
[Tansel and Garnett 1992]
Abdullah Uz Tansel, Lucy Garnett: On Roth, Korth, and Silberschatz's Extended Algebra and Calculus for Nested Relational Databases. ACM Trans. Database Syst. 17(2): 374-383(1992) BibTeX
[Teoroy et al. 1986]
Toby J. Teorey, Dongqing Yang, James P. Fry: A Logical Design Methodology for Relational Databases Using the Extended Entity-Relationship Model. ACM Comput. Surv. 18(2): 197-222(1986) BibTeX
[Teradata 1983]
[Thomas et al. 1990]
Gomer Thomas, Glenn R. Thompson, Chin-Wan Chung, Edward Barkmeyer, Fred Carter, Marjorie Templeton, Stephen Fox, Berl Hartman: Heterogeneous Distributed Database Systems for Production Use. ACM Comput. Surv. 22(3): 237-266(1990) BibTeX
[Tompa and Blakeley 1988]
Frank Wm. Tompa, José A. Blakeley: Maintaining materialized views without accessing base data. Inf. Syst. 13(4): 393-406(1988) BibTeX
[Traiger 1982]
Irving L. Traiger: Virtual Memory Management for Database Systems. Operating Systems Review 16(4): 26-48(1982) BibTeX
[Traiger et al. 1982]
Irving L. Traiger, Jim Gray, Cesare A. Galtieri, Bruce G. Lindsay: Transactions and Consistency in Distributed Database Systems. ACM Trans. Database Syst. 7(3): 323-342(1982) BibTeX
[Tsur and Zaniolo 1984]
Shalom Tsur, Carlo Zaniolo: An Implementation of GEM - Supporting a Semantic Data Model on a Relational Back-End. SIGMOD Conference 1984: 286-295 BibTeX
[Tukey 1977]
[Unidata 1991]
[Valduriez 1987]
Patrick Valduriez: Join Indices. ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX
[Vandenberg and DeWitt 1991]
Scott L. Vandenberg, David J. DeWitt: Algebraic Support for Complex Objects with Arrays, Identity, and Inheritance. SIGMOD Conference 1991: 158-167 BibTeX
[Walton 1989]
[Walton et al. 1991]
Christopher B. Walton, Alfred G. Dale, Roy M. Jenevein: A Taxonomy and Performance Model of Data Skew Effects in Parallel Joins. VLDB 1991: 537-548 BibTeX
[Whang and Krishnamurthy 1990]
Kyu-Young Whang, Ravi Krishnamurthy: Query Optimization in a Memory-Resident Domain Relational Calculus Database System. ACM Trans. Database Syst. 15(1): 67-95(1990) 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
[Whang et al. 1984]
Kyu-Young Whang, Gio Wiederhold, Daniel Sagalowicz: Separability - An Approach to Physical Database Design. IEEE Trans. Computers 33(3): 209-222(1984) BibTeX
[Williams et al. 1982]
R. Williams, Dean Daniels, Laura M. Haas, George Lapis, Bruce G. Lindsay, Pui Ng, Ron Obermarck, Patricia G. Selinger, Adrian Walker, Paul F. Wilms, Robert A. Yost: R*: An Overview of the Architecture. JCDKB 1982: 1-27 BibTeX
[Wilschut 1993]
[Wilschut 1993]
Annita N. Wilschut, Peter M. G. Apers: Dataflow Query Execution in a Parallel Main-memory Environment. Distributed and Parallel Databases 1(1): 103-128(1993) BibTeX
[Wolf et al. 1990]
Joel L. Wolf, Daniel M. Dias, Philip S. Yu: An Effective Algorithm for Parallelizing Sort Merge in the Presence of Data Skew. DPDS 1990: 103-115 BibTeX
[Wolf et al. 1991]
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 BibTeX
[Wolniewicz and Graefe 1993]
Richard H. Wolniewicz, Goetz Graefe: Algebraic Optimization of Computations over Scientific Databases. VLDB 1993: 13-24 BibTeX
[Wong and Katz 1983]
Eugene Wong, Randy H. Katz: Distributing A Database for Parallelism. SIGMOD Conference 1983: 23-29 BibTeX
[Wong and Youssefi 1976]
Eugene Wong, Karel Youssefi: Decomposition - A Strategy for Query Processing. ACM Trans. Database Syst. 1(3): 223-241(1976) BibTeX
[Yang and Larson 1987]
H. Z. Yang, Per-Åke Larson: Query Transformation for PSJ-Queries. VLDB 1987: 245-254 BibTeX
[Youssefi and Wong 1979]
Karel Youssefi, Eugene Wong: Query Processing in a Relational Database Management System. VLDB 1979: 409-417 BibTeX
[Yu and Chang 1984]
Clement T. Yu, C. C. Chang: Distributed Query Processing. ACM Comput. Surv. 16(4): 399-433(1984) BibTeX
[Yu and Osborn 1991]
Li Yu, Sylvia L. Osborn: An Evaluation Framework for Algebraic Object-Oriented Query Models. ICDE 1991: 670-677 BibTeX
[Zaniolo 1983]
Carlo Zaniolo: The Database Language GEM. SIGMOD Conference 1983: 207-218 BibTeX
[Zaniolo 1979]
Carlo Zaniolo: Design of Relational Views over Network Schemas. SIGMOD Conference 1979: 179-190 BibTeX
[Zeller 1990]
[Zeller and Gray 1990]
Hansjörg Zeller, Jim Gray: An Adaptive Hash Join Algorithm for Multiuser Environments. VLDB 1990: 186-197 BibTeX

Referenced by

  1. Till Westmann, Donald Kossmann, Sven Helmer, Guido Moerkotte: The Implementation and Performance of Compressed Databases. SIGMOD Record 29(3): 55-67(2000)
  2. Costas Vassilakis: An Optimisation Scheme for Coalesce/Valid Time Selection Operator Sequences. SIGMOD Record 29(1): 38-43(2000)
  3. Christophe Bobineau, Luc Bouganim, Philippe Pucheral, Patrick Valduriez: PicoDMBS: Scaling Down Database Techniques for the Smartcard. VLDB 2000: 11-20
  4. Alexander S. Szalay, Peter Z. Kunszt, Ani Thakar, Jim Gray, Donald R. Slutz, Robert J. Brunner: Designing and Mining Multi-Terabyte Astronomy Archives: The Sloan Digital Sky Survey. SIGMOD Conference 2000: 451-462
  5. Manuel Rodriguez-Martinez, Nick Roussopoulos: MOCHA: A Self-Extensible Database Middleware System for Distributed Data Sources. SIGMOD Conference 2000: 213-224
  6. Roy Goldman, Jennifer Widom: WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web. SIGMOD Conference 2000: 285-296
  7. Vassilis Christophides, Sophie Cluet, Jérôme Siméon: On Wrapping Query Languages and Efficient XML Integration. SIGMOD Conference 2000: 141-152
  8. Qiu Yue Wang, Jeffrey Xu Yu, Kam-Fai Wong: Approximate Graph Schema Extraction for Semi-Structured Data. EDBT 2000: 302-316
  9. 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
  10. Peter A. Boncz, Martin L. Kersten: MIL Primitives for Querying a Fragmented World. VLDB J. 8(2): 101-119(1999)
  11. Jennifer Widom: Review - Query Evaluation Techniques for Large Databases. ACM SIGMOD Digital Review 1: (1999)
  12. Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hellerstein: Online Dynamic Reordering for Interactive Data Processing. VLDB 1999: 709-720
  13. Jason McHugh, Jennifer Widom: Query Optimization for XML. VLDB 1999: 315-326
  14. Jianzhong Li, Doron Rotem, Jaideep Srivastava: Aggregation Algorithms for Very Large Compressed Data Warehouses. VLDB 1999: 651-662
  15. Alfons Kemper, Donald Kossmann, Christian Wiesner: Generalised Hash Teams for Join and Group-by. VLDB 1999: 30-41
  16. Michael Jaedicke, Bernhard Mitschang: User-Defined Table Operators: Enhancing Extensibility for ORDBMS. VLDB 1999: 494-505
  17. Peter J. Haas: Techniques for Online Exploration of Large Object-Relational Datasets. SSDBM 1999: 4-12
  18. Damianos Chatziantoniou: Evaluation of Ad Hoc OLAP: In-Place Computation. SSDBM 1999: 34-43
  19. Ming-Chuan Wu: Query Optimization for Selections Using Bitmaps. SIGMOD Conference 1999: 227-238
  20. Arunprasad P. Marathe, Kenneth Salem: Query Processing Techniques for Arrays. SIGMOD Conference 1999: 323-334
  21. Nikos Mamoulis, Dimitris Papadias: Integration of Spatial Join Algorithms for Processing Multiple Inputs. SIGMOD Conference 1999: 1-12
  22. Zachary G. Ives, Daniela Florescu, Marc Friedman, Alon Y. Levy, Daniel S. Weld: An Adaptive Query Execution System for Data Integration. SIGMOD Conference 1999: 299-310
  23. Peter J. Haas, Joseph M. Hellerstein: Ripple Joins for Online Aggregation. SIGMOD Conference 1999: 287-298
  24. Reinhard Braumandl, Alfons Kemper, Donald Kossmann: Database Patchwork on the Internet. SIGMOD Conference 1999: 550-552
  25. Dimitris Papadias, Nikos Mamoulis, Yannis Theodoridis: Processing and Optimization of Multiway Spatial Joins Using R-Trees. PODS 1999: 44-55
  26. Francis C. Chu, Joseph Y. Halpern, Praveen Seshadri: Least Expected Cost Query Optimization: An Exercise in Utility. PODS 1999: 138-147
  27. Haruo Yokota, Yasuhiko Kanemasa, Jun Miyazaki: Fat-Btree: An Update-Conscious Parallel Directory Structure. ICDE 1999: 448-457
  28. Uwe Röhm, Klemens Böhm: Working Together in Harmony - An Implementation of the CORBA Object Query Service and Its Evaluation. ICDE 1999: 238-247
  29. Volker Markl, Martin Zirkel, Rudolf Bayer: Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm. ICDE 1999: 562-571
  30. Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999: 257
  31. Jacek Plodzien, Anna Kraken: Object Query Optimization in the Stack-Based Approach. ADBIS 1999: 303-316
  32. Gunter Saake, Andreas Heuer: Datenbanken: Implementierungstechniken. MITP-Verlag 1999, ISBN 3-8266-0513-6
  33. Stefan Deßloch, Theo Härder, Nelson Mendonça Mattos, Bernhard Mitschang, Joachim Thomas: Advanced Data Processing in KRISYS: Modeling Concepts, Implementation Techniques, and Client/Server Issues. VLDB J. 7(2): 79-95(1998)
  34. Anthony Tomasic, Louiqa Raschid, Patrick Valduriez: Scaling Access to Heterogeneous Data Sources with DISCO. IEEE Trans. Knowl. Data Eng. 10(5): 808-823(1998)
  35. Michael Ortega, Yong Rui, Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Mehrotra, Thomas S. Huang: Supporting Ranked Boolean Similarity Queries in MARS. IEEE Trans. Knowl. Data Eng. 10(6): 905-925(1998)
  36. Weiye Zhang, Per-Åke Larson: Buffering and Read-Ahead Strategies for External Mergesort. VLDB 1998: 523-533
  37. Guido Moerkotte: Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. VLDB 1998: 476-487
  38. Goetz Graefe, Ross Bunker, Shaun Cooper: Hash Joins and Hash Teams in Microsoft SQL Server. VLDB 1998: 86-97
  39. Reinhard Braumandl, Jens Claußen, Alfons Kemper: Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases. VLDB 1998: 110-122
  40. Tolga Urhan, Michael J. Franklin, Laurent Amsaleg: Cost Based Query Scrambling for Initial Delays. SIGMOD Conference 1998: 130-141
  41. Per-Åke Larson, Goetz Graefe: Memory Management During Run Generation in External Sorting. SIGMOD Conference 1998: 472-483
  42. Michael Jaedicke, Bernhard Mitschang: On Parallel Processing of Aggregate and Scalar Functions in Object-Relational DBMS. SIGMOD Conference 1998: 379-389
  43. Stéphane Grumbach, Philippe Rigaux, Luc Segoufin: The DEDALE System for Complex Spatial Queries. SIGMOD Conference 1998: 213-224
  44. Chee Yong Chan, Yannis E. Ioannidis: Bitmap Index Design and Evaluation. SIGMOD Conference 1998: 355-366
  45. Surajit Chaudhuri: An Overview of Query Optimization in Relational Systems. PODS 1998: 34-43
  46. Takeshi Fukuda, Hirofumi Matsuzawa: Parallel Processing of Multiple Aggregate Queries on Shared-Nothing Multiprocessors. EDBT 1998: 278-292
  47. Staffan Flodin, Kjell Orsborn, Tore Risch: Using Queries with Multi-Directional Functions for Numerical Database Applications. ADBIS 1998: 58-70
  48. 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)
  49. Gennady Antoshenkov: Dictionary-Based Order-Preserving String Compression. VLDB J. 6(1): 26-39(1997)
  50. 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)
  51. Lars Bækgaard, Leo Mark: Incremental Computation of Set Difference Views. IEEE Trans. Knowl. Data Eng. 9(2): 251-261(1997)
  52. Laurent Amsaleg, Philippe Bonnet, Michael J. Franklin, Anthony Tomasic, Tolga Urhan: Improving Responsiveness for Wide-Area Data Access. IEEE Data Eng. Bull. 20(3): 3-11(1997)
  53. Weiye Zhang, Per-Åke Larson: Dynamic Memory Adjustment for External Mergesort. VLDB 1997: 376-385
  54. Mary Tork Roth, Peter M. Schwarz: Don't Scrap It, Wrap It! A Wrapper Architecture for Legacy Data Sources. VLDB 1997: 266-275
  55. Minos N. Garofalakis, Yannis E. Ioannidis: Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources. VLDB 1997: 296-305
  56. Jens Claußen, Alfons Kemper, Guido Moerkotte, Klaus Peithner: Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases. VLDB 1997: 286-295
  57. Timothy Griffin, Richard Hull: A Framework for Implementing Hypothetical Queries. SIGMOD Conference 1997: 231-242
  58. Giuseppe Amato, Fosca Giannotti, Gianni Mainetto: Static Analysis of Transactions for Conservative Multigranularity Locking. DBPL 1997: 413-430
  59. Michael Gesmann: A Cost Model for Parallel Navigational Access in Complex-Object DBMSs. DASFAA 1997: 1-10
  60. Silvio Salza, Massimiliano Renzetti: A Modeling Tool for Workload Analysis and Performance Tuning of Parallel Database Applications. ADBIS 1997: 152-161
  61. Gisela Fischer, Karl Aberer: Admissible Record-Oriented Evaluation Plans for Declarative Updates. ADBIS 1997: 133-140
  62. Evan P. Harris, Kotagiri Ramamohanarao: Join Algorithm Costs Revisited. VLDB J. 5(1): 64-84(1996)
  63. Myra Spiliopoulou, Michael Hatzopoulos, Yannis Cotronis: Parallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline. IEEE Trans. Knowl. Data Eng. 8(3): 429-445(1996)
  64. Sunita Sarawagi, Michael Stonebraker: Reordering Query Execution in Tertiary Memory Databases. VLDB 1996: 156-167
  65. Luc Bouganim, Daniela Florescu, Patrick Valduriez: Dynamic Load Balancing in Hierarchical Parallel Database Systems. VLDB 1996: 436-447
  66. Michael H. Böhlen, Richard T. Snodgrass, Michael D. Soo: Coalescing in Temporal Databases. VLDB 1996: 180-191
  67. Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi: On the Computation of Multidimensional Aggregates. VLDB 1996: 506-521
  68. Nabil I. Hachem, Chenye Bao, Steve Taylor: Approximate Query Answering In Numerical Databases. SSDBM 1996: 63-73
  69. David E. Simmen, Eugene J. Shekita, Timothy Malkemus: Fundamental Techniques for Order Optimization. SIGMOD Conference 1996: 57-67
  70. Joseph M. Hellerstein, Jeffrey F. Naughton: Query Execution Techniques for Caching Expensive Methods. SIGMOD Conference 1996: 423-434
  71. Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216
  72. Michael J. Franklin, Björn Þór Jónsson, Donald Kossmann: Performance Tradeoffs for Client-Server Query Processing. SIGMOD Conference 1996: 149-160
  73. Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger: Parallel Processing of Spatial Joins Using R-trees. ICDE 1996: 258-265
  74. Hennie J. Steenhagen, Rolf A. de By, Henk M. Blanken: Translating OSQL-Queries into Efficient Set Expressions. EDBT 1996: 183-197
  75. David E. Simmen, Eugene J. Shekita, Timothy Malkemus: Fundamental Techniques for Order Optimization. EDBT 1996: 625-628
  76. Nadejda Biscondi, André Flory, Lionel Brunie: Parallel Databases: Structured Query Optimization. ADBIS 1996: 146-152
  77. Goetz Graefe, Richard L. Cole: Fast Algorithms for Universal Quantification in Large Databases. ACM Trans. Database Syst. 20(2): 187-236(1995)
  78. Goetz Graefe: The Cascades Framework for Query Optimization. IEEE Data Eng. Bull. 18(3): 19-29(1995)
  79. Erhard Rahm, Robert Marek: Dynamic Multi-Resource Load Balancing in Parallel Database Systems. VLDB 1995: 395-406
  80. Ashish Gupta, Venky Harinarayan, Dallan Quass: Aggregate-Query Processing in Data Warehousing Environments. VLDB 1995: 358-369
  81. Ambuj Shatdal, Jeffrey F. Naughton: Adaptive Parallel Aggregation Algorithms. SIGMOD Conference 1995: 104-114
  82. Gerhard Weikum: Tutorial on Parallel Database Systems. ICDT 1995: 33-37
  83. César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten: Uniformly-Distributed Random Generation of Join Orders. ICDT 1995: 280-293
  84. Dinesh Das, Don S. Batory: Praire: A Rule Specification Framework for Query Optimizers. ICDE 1995: 201-210
  85. Theodore W. Leung: Scheduling Resource Usage in Object-Oriented Queries. DBPL 1995: 9
  86. Zhe Li, Kenneth A. Ross: PERF Join: An Alternative to Two-way Semijoin and Bloomjoin. CIKM 1995: 137-144
  87. Uwe Herzog, Ralf Schaarschmidt: Parallel Execution of Integrity Constraint Checks. CIKM 1995: 82-89
  88. Elisa Bertino, S. Salerno, Boris Shidlovsky: Enhanced Nested-Inherited Index for OODBMS. CIKM 1995: 58-65
  89. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
  90. Zhaohui Xie, Jiawei Han: Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases. VLDB 1994: 522-533
  91. Hennie J. Steenhagen, Peter M. G. Apers, Henk M. Blanken, Rolf A. de By: From Nested-Loop to Join Queries in OODB. VLDB 1994: 618-629
  92. César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten: Fast, Randomized Join-Order Selection - Why Use Transformations? VLDB 1994: 85-95
  93. Diane L. Davison, Goetz Graefe: Memory-Contention Responsive Hash Joins. VLDB 1994: 379-390
  94. Richard L. Cole, Goetz Graefe: Optimization of Dynamic Query Evaluation Plans. SIGMOD Conference 1994: 150-160
  95. Goetz Graefe: Sort-Merge-Join: An Idea Whose Time Has(h) Passed? ICDE 1994: 406-417
  96. Richard L. Cole, Mark J. Anderson, Robert J. Bestgen: Query Processing in the IBM Application System/400. IEEE Data Eng. Bull. 16(4): 19-28(1993)
  97. Bennet Vance: An Abstract Object-Oriented Query Execution Language. DBPL 1993: 176-199
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:54:48 2009