Ullman: Principles of Database and Knowledge-Base Systems

1. Databases, Object Bases, and Knowledge Bases
2. Data Models for Database Systems
3. Logic as a Data Model
4. Relational Query Languages
5. Object-Oriented Database Languages
6. Physical Data Organization
7. Design Theory for Relational Databases
8. Protecting the Database Against Misuse
9. Transaction Management
10. Distributed Database Management

11. Query Optimization for Database Systems
12. More About Logic
13. Combining Top-Down and Bottom-Up Logic Evaluation
14. Optimization for Conjunctive Queries
15. Optimization of Linear Recursions
16. Some Experimental Knowledge-Base Systems
17. The Universal Relation as a User Interface

Volume 1

Bibliography for Volumes 1 and 2 / "References by" for Volume 2

References

[Abiteboul and Grumbach 1987]

...

[Abiteboul and Hull 1987]

Serge Abiteboul, Richard Hull: IFO: A Formal Semantic Database Model. PODS 1984: 119-132

[Abiteboul and Vianu 1988]

Serge Abiteboul, Victor Vianu: Procedural and Declarative Database Update Languages. PODS 1988: 240-250

[Addis 1982]

Thomas R. Addis: A Relation-Based Language Interpreter for Content Addressable File Store. ACM Trans. Database Syst. 7(2): 125-163(1982)

[Afrati et al. 1986]

Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman: Convergence of Sideways Query Evaluation. PODS 1986: 24-30

[Aghili and Severance 1982]

Houtan Aghili, Dennis G. Severance: A Practical Guide to the Design of Differential Files for Recovery of On-Line Databases. ACM Trans. Database Syst. 7(4): 540-565(1982)

[Agrawal et al. 1985]

Rakesh Agrawal, Michael J. Carey, Miron Livny: Models for Studying Concurrency Control Performance: Alternatives and Implications. SIGMOD Conference 1985: 108-121

[Agrawal and de Witt 1985]

Rakesh Agrawal, David J. DeWitt: Integrated Concurrency Control and Recovery Mechanisms: Design and Performance Evaluation. ACM Trans. Database Syst. 10(4): 529-564(1985)

[Agrawal and Jagadish 1987]

Rakesh Agrawal, H. V. Jagadish: Direct Algorithms for Computing the Transitive Closure of Database Relations. VLDB 1987: 255-266

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

[Aho et al. 1974]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6

[Aho et al. 1983]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7

[Aho et al. 1979a]

Alfred V. Aho, Brian W. Kernighan, Peter J. Weinberger: Awk-A Pattern Scanning and Processing Language. Softw., Pract. Exper. 9(4): 267-279(1979)

[Aho et al. 1988]

Alfred V. Aho, Brian W. Kernighan, Peter J. Weinberger: The AWK Programming Language. Addison-Wesley 1988

[Aho et al. 1986]

Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers: Princiles, Techniques, and Tools. Addison-Wesley 1986, ISBN 0-201-10088-6

[Aho et al. 1979b]

Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979)

[Aho et al. 1979c]

Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions. ACM Trans. Database Syst. 4(4): 435-454(1979)

[Aho and Ullman 1979a]

Alfred V. Aho, Jeffrey D. Ullman: Optimal Partial-Match Retrieval When Fields Are Independently Specified. ACM Trans. Database Syst. 4(2): 168-179(1979)

[Aho and Ullman 1979b]

Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120

[ANSI 1975]

...

[Apers et al. 1983]

Peter M. G. Apers, Alan R. Hevner, S. Bing Yao: Optimization Algorithms for Distributed Queries. IEEE Trans. Software Eng. 9(1): 57-68(1983)

[Apt 1987]

Krzysztof R. Apt: Logic Programming. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 493-574

[Apt et al. 1985]

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148

[Apt and Pugin 1987]

Krzysztof R. Apt, Jean-Marc Pugin: Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987: 136-145

[Apt and van Emden 1982]

Krzysztof R. Apt, Maarten H. van Emden: Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862(1982)

[Armstrong 1974]

William Ward Armstrong: Dependency Structures of Data Base Relationships. IFIP Congress 1974: 580-583

[Arora and Carlson 1978]

Adarsh K. Arora, C. Robert Carlson: The Information Preserving Properties of Relational Database Transformations. VLDB 1978: 352-359

[Astrahan and Chamberlin 1975]

Morton M. Astrahan, Donald D. Chamberlin: Implementation of a Structured English Query Language. Commun. ACM 18(10): 580-588(1975)

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

[Astrahan et al. 1979]

Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Paolo Tiberio, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: System R: A Relational Data Base Management System. IEEE Computer 12(5): 42-48(1979)

[Astrahan et al. 1980]

Morton M. Astrahan, Mario Schkolnick, Won Kim: Performance of the System R Access Path Selection Mechanism. IFIP Congress 1980: 487-491

[Atzeni and Chan 1985]

Paolo Atzeni, Edward P. F. Chan: Efficient Query Answering in the Representative Instance Approach. PODS 1985: 181-188

[Atzeni and DeBernardis 1987]

Paolo Atzeni, Maria Cristina De Bernardis: A New Basis for the Weak Instance Model. PODS 1987: 79-86

[Atzeni and Parker 1982]

Paolo Atzeni, Douglas Stott Parker Jr.: Assumptions in Relational Database Theory. PODS 1982: 1-9

[Bachman 1969]

...

[Badal 1980]

Dushan Z. Badal: The Analysis of the Effects of Concurrency Control on Distributed Database System Performance. VLDB 1980: 376-383

[Balbin et al. 1988]

...

[Balbin et al. 1987]

...

[Balbin and Ramamohanarao 1986]

...

[Bancilhon 1986a]

François Bancilhon: A Logic-Programming/Object-Oriented Cocktail. SIGMOD Record 15(3): 11-21(1986)

[Bancilhon 1986b]

François Bancilhon: Naive Evaluation of Recursively Defined Relations. On Knowledge Base Management Systems (Islamorada) 1985: 165-178

[Bancilhon and Khoshafian 1986]

François Bancilhon, Setrag Khoshafian: A Calculus for Complex Objects. PODS 1986: 53-60

[Bancilhon et al. 1986]

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15

[Bancilhon and Ramakrishnan 1986]

François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52

[Baroody and DeWitt 1981]

A. James Baroody Jr., David J. DeWitt: An Object-Oriented Approach to Database System Implementation. ACM Trans. Database Syst. 6(4): 576-601(1981)

[Batory 1988]

Don S. Batory: Concepts for a Database System Compiler. PODS 1988: 184-192

[Batory et al. 1988]

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)

[Bayer 1985]

...

[Bayer et al. 1980]

Rudolf Bayer, Klaus Elhardt, Hans Heller, Angelika Reiser: Distributed Concurrency Control in Database Systems. VLDB 1980: 275-284

[Bayer and McCreight 1972]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972)

[Bayer and Schkolnick 1977]

Rudolf Bayer, Mario Schkolnick: Concurrency of Operations on B-Trees. Acta Inf. 9: 1-21(1977)

[Beck 1978]

...

[Beech 1987]

...

[Beeri 1980]

Catriel Beeri: On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases. ACM Trans. Database Syst. 5(3): 241-259(1980)

[Beeri and Bernstein 1979]

Catriel Beeri, Philip A. Bernstein: Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Trans. Database Syst. 4(1): 30-59(1979)

[Beeri et al. 1978]

Catriel Beeri, Philip A. Bernstein, Nathan Goodman: A Sophisticate's Introduction to Database Normalization Theory. VLDB 1978: 113-124

[Beeri et al. 1983]

Catriel Beeri, Philip A. Bernstein, Nathan Goodman: A Concurrency Control Theory for Nested Transactions. PODC 1983: 45-62

[Beeri et al. 1977]

Catriel Beeri, Ronald Fagin, John H. Howard: A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. SIGMOD Conference 1977: 47-61

[Beeri et al. 1983]

Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis: On the Desirability of Acyclic Database Schemes. J. ACM 30(3): 479-513(1983)

[Beeri and Honeyman 1981]

Catriel Beeri, Peter Honeyman: Preserving Functional Dependencies. SIAM J. Comput. 10(3): 647-656(1981)

[Beeri et al. 1987]

Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. PODS 1987: 214-226

[Beeri et al. 1981]

Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370(1981)

[Beeri et al. 1987]

Catriel Beeri, Shamim A. Naqvi, Raghu Ramakrishnan, Oded Shmueli, Shalom Tsur: Sets and Negation in a Logic Database Language (LDL1). PODS 1987: 21-37

[Beeri and Ramakrishnan 1987]

Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. PODS 1987: 269-284

[Beeri and Vardi 1981]

Catriel Beeri, Moshe Y. Vardi: The Implication Problem for Data Dependencies. ICALP 1981: 73-85

[Beeri and Vardi 1984a]

Catriel Beeri, Moshe Y. Vardi: Formal Systems for Tuple and Equality Generating Dependencies. SIAM J. Comput. 13(1): 76-98(1984)

[Beeri and Vardi 1984b]

Catriel Beeri, Moshe Y. Vardi: A Proof Procedure for Data Dependencies. J. ACM 31(4): 718-741(1984)

[Bentley 1975]

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

[Bentley and Friedman 1979]

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979)

[Bentley and Stanat 1975]

Jon Louis Bentley, Donald F. Stanat: Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173(1975)

[Bernstein 1976]

Philip A. Bernstein: Synthesizing Third Normal Form Relations from Functional Dependencies. ACM Trans. Database Syst. 1(4): 277-298(1976)

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

[Bernstein and Goodman 1980a]

Philip A. Bernstein, Nathan Goodman: What does Boyce-Codd Normal Form Do? VLDB 1980: 245-259

[Bernstein and Goodman 1980b]

Philip A. Bernstein, Nathan Goodman: Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems. VLDB 1980: 285-300

[Bernstein and Goodman 1981a]

Philip A. Bernstein, Nathan Goodman: Power of Natural Semijoins. SIAM J. Comput. 10(4): 751-771(1981)

[Bernstein and Goodman 1981b]

Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981)

[Bernstein and Goodman 1983]

Philip A. Bernstein, Nathan Goodman: Multiversion Concurrency Control - Theory and Algorithms. ACM Trans. Database Syst. 8(4): 465-483(1983)

[Bernstein and Goodman 1984]

Philip A. Bernstein, Nathan Goodman: An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases. ACM Trans. Database Syst. 9(4): 596-615(1984)

[Bernstein et al. 1983]

Philip A. Bernstein, Nathan Goodman, Vassos Hadzilacos: Recovery Algorithms for Database Systems. IFIP Congress 1983: 799-807

[Bernstein et al. 1978]

Philip A. Bernstein, James B. Rothnie Jr., Nathan Goodman, Christos H. Papadimitriou: The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case). IEEE Trans. Software Eng. 4(3): 154-168(1978)

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

[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

[Bernstein and Shipman 1980]

Philip A. Bernstein, David W. Shipman: The Correctness of Concurrency Control Mechanisms in a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 5(1): 52-68(1980)

[Bernstein et al. 1980]

Philip A. Bernstein, David W. Shipman, James B. Rothnie Jr.: Concurrency Control in a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 5(1): 18-51(1980)

[Bidoit and Hull 1986]

Nicole Bidoit, Richard Hull: Positivism vs. Minimalism in Deductive Databases. PODS 1986: 123-132

[Biliris 1987]

Alexandros Biliris: Operation Specific Locking in B-Trees. PODS 1987: 159-169

[Biskup 1980]

Joachim Biskup: Inferences of Multivalued Dependencies in Fixed and Undetermined Universes. Theor. Comput. Sci. 10: 93-105(1980)

[Biskup and Brüggemann 1983]

Joachim Biskup, Hans Hermann Brüggemann: Universal Relation Views: A Pragmatic Approach. VLDB 1983: 172-185

[Biskup et al. 1986]

Joachim Biskup, Hans Hermann Brüggemann, L. Schnetgöke, M. Kramer: One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views. PODS 1986: 148-159

[Biskup et al. 1979]

Joachim Biskup, Umeshwar Dayal, Philip A. Bernstein: Synthesizing Independent Database Schemas. SIGMOD Conference 1979: 143-151

[Biskup and Stiefeling 1988]

Joachim Biskup, Holger Stiefeling: Transitive Closure Algorithms for Very Large Databases. WG 1988: 122-147

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

[Blasgen et al. 1981]

Mike W. Blasgen, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: System R: An Architectural Overview. IBM Systems Journal 20(1): 41-62(1981)

[Bocca 1986]

Jorge B. Bocca: EDUCE: A Marriage of Convenience: Prolog and a Relational DBMS. SLP 1986: 36-45

[Bolour 1979]

Azad Bolour: Optimality Properties of Multiple-Key Hashing Functions. J. ACM 26(2): 196-210(1979)

[Bosak et al. 1962]

...

[Boyce et al. 1975]

Raymond F. Boyce, Donald D. Chamberlin, W. Frank King III, Michael Hammer: Specifying Queries as Relational Expressions: The SQUARE Data Sublanguage. Commun. ACM 18(11): 621-628(1975)

[Brodie 1984]

Michael L. Brodie: On the Development of Data Models. On Conceptual Modelling (Intervale) 1982: 19-47

[Brodie and Mylopoulos 1986]

Michael L. Brodie, John Mylopoulos (Eds.): On Knowledge Base Management Systems: Integrating Artificial Intelligence and Database Technologies, Book resulting from the Islamorada Workshop 1985. Topics in Information Systems Springer 1986, ISBN 3-540-96382-0
Contents

[Brodie et al. 1984]

...

[Brown et al. 1984]

Mark R. Brown, Karen N. Kolling, Edward A. Taft: The Alpine File System. ACM Trans. Comput. Syst. 3(4): 261-293(1985)

[Buckley and Silberschatz 1985]

Gael N. Buckley, Abraham Silberschatz: Beyond Two-Phase Locking. J. ACM 32(2): 314-326(1985)

[Burkhard 1976]

Walter A. Burkhard: Hashing and Trie Algorithms for Partial Match Retrieval. ACM Trans. Database Syst. 1(2): 175-187(1976)

[Burkhard et al. 1981]

Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman: Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. 16: 279-290(1981)

[Cardenas 1979]

...

[Carey 1983]

Michael J. Carey: Granularity Hierarchies in Concurrency Control. PODS 1983: 156-165

[Carey et al. 1986]

Michael J. Carey, David J. DeWitt, Daniel Frank, Goetz Graefe, M. Muralikrishna, Joel E. Richardson, Eugene J. Shekita: The Architecture of the EXODUS Extensible DBMS. OODBS 1986: 52-65

[Carlson and Kaplan 1976]

C. Robert Carlson, Robert S. Kaplan: A Generalized Access Path Model and its Application to a Relational Data Base System. SIGMOD Conference 1976: 143-154

[Casanova et al. 1984]

Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou: Inclusion Dependencies and Their Interaction with Functional Dependencies. J. Comput. Syst. Sci. 28(1): 29-59(1984)

[Ceri et al. 1987]

Stefano Ceri, Georg Gottlob, Gio Wiederhold: Interfacing Relational Databases and Prolog Efficiently. Expert Database Conf. 1986: 207-223

[Ceri and Pelkagatti 1980]

...

[Ceri and Pelagatti 1984]

Stefano Ceri, Giuseppe Pelagatti: Distributed Databases: Principles and Systems. McGraw-Hill Book Company 1984, ISBN 0-07-010829-3

[Chakravarthy and Minker 1986]

Upen S. Chakravarthy, Jack Minker: Multiple Query Processing in Deductive Databases using Query Graphs. VLDB 1986: 384-391

[Chamberlin et al. 1976]

Donald D. Chamberlin, Morton M. Astrahan, Kapali P. Eswaran, Patricia P. Griffiths, Raymond A. Lorie, James W. Mehl, Phyllis Reisner, Bradford W. Wade: SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control. IBM Journal of Research and Development 20(6): 560-575(1976)

[Chamberlin et al. 1981a]

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)

[Chamberlin et al. 1981b]

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)

[Chandra 1988]

Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9

[Chandra and Harel 1980]

Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980)

[Chandra and Harel 1982]

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128(1982)

[Chandra and Harel 1985]

Ashok K. Chandra, David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15(1985)

[Chandra et al. 1981]

Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky: Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354

[Chandra and Merlin 1977]

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90

[Chandy et al. 1975]

K. Mani Chandy, James C. Browne, Charles W. Dissly, Werner R. Uhrig: Analytic Models for Rollback and Recovery Strategies in Data Base Systems. IEEE Trans. Software Eng. 1(1): 100-110(1975)

[Chan 1984]

Edward P. F. Chan: Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. SIGMOD Conference 1984: 149-163

[Chang 1980]

...

[Chang 1981]

Chin-Liang Chang: On Evaluation of Queries Containing Derived Relations in a Relational Data Base. Advances in Data Base Theory 1979: 235-260

[Chen 1976]

Peter P. Chen: The Entity-Relationship Model - Toward a Unified View of Data. ACM Trans. Database Syst. 1(1): 9-36(1976)

[Childs 1968]

...

[Chimenti et al. 1987]

Danette Chimenti, Anthony B. O'Hare, Ravi Krishnamurthy, Shalom Tsur, Carolyn West, Carlo Zaniolo: An Overview of the LDL System. IEEE Data Eng. Bull. 10(4): 52-62(1987)

[Chiu et al. 1981]

Dah-Ming W. Chiu, Philip A. Bernstein, Yu-Chi Ho: Optimizing Chain Queries in a Distributed Database System. SIAM J. Comput. 13(1): 116-134(1984)

[Cincom 1978]

...

[Clark 1978]

Keith L. Clark: Negation as Failure. Logic and Data Bases 1977: 293-322

[Clocksin and Mellish 1981]

W. F. Clocksin, Chris Mellish: Programming in Prolog. Springer 1981

[CODASYL 1971]

...

[CODASYL 1978]

...

[Codd 1970]

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

[Codd 1972a]

E. F. Codd: Further Normalization of the Data Base Relational Model. IBM Research Report, San Jose, California RJ909: (1971)

[Codd 1972b]

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)

[Codd 1975]

...

[Codd 1979]

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

[Codd 1988]

E. F. Codd: 'Universal' Relation Fails to Replace Relational Model (letter to the editor). IEEE Software 5(4): 4-6(1988)

[Comer 1978]

Douglas Comer: The Difficulty of Optimum Index Selection. ACM Trans. Database Syst. 3(4): 440-445(1978)

[Comer 1979]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979)

[Cooper 1980]

Eric C. Cooper: On the Expressive Power of Query Languages for Relational Databases. POPL 1982: 361-365

[Cosmadakis and Afrati 1988]

Foto N. Afrati, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126

[Cosmadakis et al. 1988]

Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi: Decidable Optimization Problems for Database Logic Programs (Preliminary Report). STOC 1988: 477-490

[Cosmadakis and Kanellakis 1986]

Stavros S. Cosmadakis, Paris C. Kanellakis: Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293

[Cruz and Norvell 1988]

Isabel F. Cruz, Theodore S. Norvell: Aggregative Closure: An Extension of Transitive Closure. ICDE 1989: 384-391

[Culik et al. 1981]

Karel Culik II, Thomas Ottmann, Derick Wood: Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512(1981)

[Cullinane 1978]

...

[Danforth et al. 1988]

...

[Daniels 1982]

Dean Daniels, Patricia G. Selinger, Laura M. Haas, Bruce G. Lindsay, C. Mohan, Adrian Walker, Paul F. Wilms: An Introduction to Distributed Query Compilation in R*. DDB 1982: 291-309

[Date 1986]

C. J. Date: An Introduction to Database Systems, Volume I, 4th Edition. Addison-Wesley 1986

[D`Atri and Moscarini 1986]

Alessandro D'Atri, Marina Moscarini: Recognition Algorithms and Design Methodologies for Acyclic Database Schemes. Advances in Computing Research 3: 43-67(1986)

[Davidson 1984]

Susan B. Davidson: Optimism and Consistency In Partitioned Distributed Database Systems. ACM Trans. Database Syst. 9(3): 456-481(1984)

[Dayal and Bernstein 1978]

Umeshwar Dayal, Philip A. Bernstein: On the Updatability of Relational Views. VLDB 1978: 368-377

[Dayal and Bernstein 1982]

Umeshwar Dayal, Philip A. Bernstein: On the Correct Translation of Update Operations on Relational Views. ACM Trans. Database Syst. 7(3): 381-416(1982)

[Dayal and Smith 1986]

Umeshwar Dayal, John Miles Smith: PROBE: A Knowledge-Oriented Database Management System. On Knowledge Base Management Systems (Islamorada) 1985: 227-257

[Debray and Warren 1986]

Saumya K. Debray, David Scott Warren: Automatic Mode Inference for Prolog Programs. SLP 1986: 78-88

[Delobel 1978]

Claude Delobel: Normalization and Hierarchical Dependencies in the Relational Data Model. ACM Trans. Database Syst. 3(3): 201-222(1978)

[Delobel and Casey 1972]

Claude Delobel, Richard G. Casey: Decomposition of a Data Base and the Theory of Boolean Switching Functions. IBM Journal of Research and Development 17(5): 374-386(1973)

[DeWitt and Gerber 1985]

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

[Dietrich 1987]

Suzanne W. Dietrich: Extension Tables: Memo Relations in Logic Programming. SLP 1987: 264-272

[Dietrich and Warren 1985]

...

[DiPaola 1969]

Robert A. Di Paola: The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas. J. ACM 16(2): 324-327(1969)

[Dwork and Skeen 1983]

Cynthia Dwork, Dale Skeen: The Inherent Cost of Nonblocking Commitment. PODC 1983: 1-11

[Eager and Sevcik 1983]

Derek L. Eager, Kenneth C. Sevcik: Achieving Robustness in Distributed Database Systems. ACM Trans. Database Syst. 8(3): 354-381(1983)

[Earley 1970]

Jay Earley: An Efficient Context-Free Parsing Algorithm. Commun. ACM 13(2): 94-102(1970)

[El Abadi and Toueg 1986]

Amr El Abbadi, Sam Toueg: Availability in Partitioned Replicated Databases. PODS 1986: 240-251

[Ellis 1980]

Carla Schlatter Ellis: Concurrent Search and Insertion in 2-3 Trees. Acta Inf. 14: 63-86,(1980)

[Ellis 1987]

Carla Schlatter Ellis: Concurrency in Linear Hashing. ACM Trans. Database Syst. 12(2): 195-217(1987)

[El Masri and Wiederhold 1979]

Ramez Elmasri, Gio Wiederhold: Data Model Integration Using the Structural Model. SIGMOD Conference 1979: 191-202

[Epstein et al. 1979]

Robert S. Epstein, Michael Stonebraker, Eugene Wong: Distributed Query Processing in a Relational Data Base System. SIGMOD Conference 1978: 169-180

[Eswaran et al. 1976]

Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976)

[Fagin 1977]

Ronald Fagin: Multivalued Dependencies and a New Normal Form for Relational Databases. ACM Trans. Database Syst. 2(3): 262-278(1977)

[Fagin 1978]

Ronald Fagin: On an Authorization Mechanism. ACM Trans. Database Syst. 3(3): 310-319(1978)

[Fagin 1981]

Ronald Fagin: A Normal Form for Relational Databases That Is Based on Domians and Keys. ACM Trans. Database Syst. 6(3): 387-415(1981)

[Fagin 1982]

Ronald Fagin: Horn clauses and database dependencies. J. ACM 29(4): 952-985(1982)

[Fagin 1983]

Ronald Fagin: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. ACM 30(3): 514-550(1983)

[Fagin et al. 1982]

Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman: A Simplified Universal Relation Assumption and Its Properties. ACM Trans. Database Syst. 7(3): 343-360(1982)

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

[Fagin and Vardi 1986]

...

[Fekete et al. 1987]

Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Nested Transactions and Read/Write Locking. PODS 1987: 97-111

[Fernandez et al. 1980]

...

[Filat and Kraning 1970]

...

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

[Fischer and Tsou 1983]

Patrick C. Fischer, Don-Min Tsou: Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard. SIAM J. Comput. 12(2): 259-266(1983)

[Fischer and van Gucht 1984]

Patrick C. Fischer, Dirk Van Gucht: Weak Multivalued Dependencies. PODS 1984: 266-274

[Fishman et al. 1986]

Daniel H. Fishman, David Beech, H. P. Cate, E. C. Chow, Tim Connors, J. W. Davis, Nigel Derrett, C. G. Hoch, William Kent, Peter Lyngbæk, Brom Mahbod, Marie-Anne Neimat, T. A. Ryan, Ming-Chien Shan: Iris: An Object-Oriented Database Management System. ACM Trans. Inf. Syst. 5(1): 48-69(1987)

[Fong and Ullman 1976]

Amelia C. Fong, Jeffrey D. Ullman: Induction Variables in Very High Level Languages. POPL 1976: 104-112

[Franaszek and Robinson 1985]

Peter A. Franaszek, John T. Robinson: Limitations of Concurrency in Transaction Processing. ACM Trans. Database Syst. 10(1): 1-28(1985)

[Fredman 1981]

Michael L. Fredman: A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705(1981)

[Freytag 1987]

Johann Christoph Freytag: A Rule-Based View of Query Optimization. SIGMOD Conference 1987: 173-180

[Frost 1986]

Richard A. Frost: Introduction to Knowledge Base Systems. Collins 1986, ISBN 0-00-383114-0

[Furtado 1978]

Antonio L. Furtado: Formal aspects of the relational model. Inf. Syst. 3(2): 131-140(1978)

[Gaifman et al. 1987]

Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. LICS 1987: 106-115

[Galil 1982]

Zvi Galil: An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database. J. ACM 29(1): 96-102(1982)

[Gallaire and Minker 1978]

Hervé Gallaire, Jack Minker (Eds.): Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, 1977. Advances in Data Base Theory Plemum Press 1978, ISBN 0-306-40060-X
Contents

[Gallaire et al. 1981]

Hervé Gallaire, Jean-Marie Nicolas, Jack Minker (Eds.): Advances in Data Base Theory, Vol. 1, Based on the Proceedings of the Workshop on Formal Bases for Data Bases, December 12-14, 1979, Centre d'Etudes et de Recherches de l'Ecole Nationale Supérieure de l'Aéronautique et de l'Espace de Toulouse (CERT), France. Advances in Data Base Theory Plemum Press 1981, ISBN 0-306-40629-2
Contents

[Gallaire et al. 1983]

Hervé Gallaire, Jean-Marie Nicolas, Jack Minker (Eds.): Advances in Data Base Theory, Vol. 2, Based on the Proceedings of the Workshop on Logical Data Bases, December 14-17, 1982, Centre d'études et de recherches de Toulouse, France. Advances in Data Base Theory Plemum Press 1984, ISBN 0-306-41636-0
Contents

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

[Gangopadhyay 1987]

...

[Garcia-Molina 1979]

...

[Garcia-Molina 1982]

Hector Garcia-Molina: Elections in a Distributed Computing System. IEEE Trans. Computers 31(1): 48-59(1982)

[Garcia-Molina and Kent 1985]

Jack Kent, Hector Garcia-Molina, Jae Chung: An Experimental Evaluation of Crash Recovery Mechanisms. PODS 1985: 113-122

[Gardarin and Maindreville 1986]

Georges Gardarin, Christophe de Maindreville: Evaluation of Database Recursive Logic Programs as Recurrent Function Series. SIGMOD Conference 1986: 177-186

[Garey and Johnson 1979]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7

[Gelenbe and Derochette 1978]

Erol Gelenbe, D. Derochette: Performance of Rollback Recovery Systems under Intermittent Failures. Commun. ACM 21(6): 493-499(1978)

[Gelfond and Lifschitz 1988]

Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080

[Gelfond eta l. 1986]

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski: The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. PODS 1986: 133-139

[Genesereth 1983]

...

[Genesereth and Nilsson 1988]

...

[Ginsberg 1988]

...

[Ginsburg and Zaiddan 1982]

Seymour Ginsburg, Sami Mohammed Zaiddan: Properties of functional-dependency families. J. ACM 29(3): 678-698(1982)

[Goldberg and Robson 1980]

Adele Goldberg, David Robson: Smalltalk-80: The Language and Its Implementation. Addison-Wesley 1983

[Gonzalez-Rubio et al. 1987]

...

[Goodman 1981]

...

[Goodman 1970]

...

[Goodman and Shmueli 1982]

Nathan Goodman, Oded Shmueli: Tree Queries: A Simple Class of Relational Queries. ACM Trans. Database Syst. 7(4): 653-677(1982)

[Goodman and Shmueli 1983]

Nathan Goodman, Oded Shmueli: Syntactic Characterization of Tree Database Schemas. J. ACM 30(4): 767-786(1983)

[Gotlieb and Tompa 1973]

C. C. Gotlieb, Frank Wm. Tompa: Choosing a Storage Schema. Acta Inf. 3: 297-319(1974)

[Gotlieb 1975]

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

[Gottlob 1987]

Georg Gottlob: Computing Covers for Embedded Functional Dependencies. PODS 1987: 58-69

[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

[Graefe and DeWitt 1987]

Goetz Graefe, David J. DeWitt: The EXODUS Optimizer Generator. SIGMOD Conference 1987: 160-172

[Graham 1979]

...

[Graham et al. 1986]

Marc H. Graham, Alberto O. Mendelzon, Moshe Y. Vardi: Notions of dependency satisfaction. J. ACM 33(1): 105-129(1986)

[Graham and Yannakakis 1984]

Marc H. Graham, Mihalis Yannakakis: Independent Database Schemas. J. Comput. Syst. Sci. 28(1): 121-141(1984)

[Grahne and Raiha 1986]

Gösta Grahne, Kari-Jouko Räihä: Characterizations for Acyclic Database Schemes. Advances in Computing Research 3: 19-41(1986)

[Gray 1978]

Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481

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

[Gray et al. 1975]

Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger: Granularity of Locks in a Large Shared Data Base. VLDB 1975: 428-451

[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

[Gray et al. 1976]

Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger: Granularity of Locks and Degrees of Consistency in a Shared Data Base. IFIP Working Conference on Modelling in Data Base Management Systems 1976: 365-394

[Greenblatt and Waxman 1978]

David Greenblatt, Jerry Waxman: A Study of Three Database Query Languages. JCDKB 1978: 77-97

[Griffiths eta l. 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

[Griffiths and Wade 1976]

Patricia P. Griffiths, Bradford W. Wade: An Authorization Mechanism for a Relational Database System. ACM Trans. Database Syst. 1(3): 242-255(1976)

[Gudes and Tsur 1980]

Ehud Gudes, Shalom Tsur: Experiments with B-Tree Reorganization. SIGMOD Conference 1980: 200-206

[Gruevich and Lewis 1982]

Yuri Gurevich, Harry R. Lewis: The Inference Problem for Template Dependencies. PODS 1982: 221-229

[Haas et al. 1988]

...

[Haberman 1970]

...

[Haddad and Naughton 1988]

Ramsey W. Haddad, Jeffrey F. Naughton: Counting Methods for Cyclic Relations. PODS 1988: 333-340

[Hadzilacos and Papadimitriou 1985]

Thanasis Hadzilacos, Christos H. Papadimitriou: Algorithmic Aspects of Multiversion Concurrency Control. PODS 1985: 96-104

[Hadzilacos and Yannakakis 1986]

Thanasis Hadzilacos, Mihalis Yannakakis: Deleting Completed Transactions. PODS 1986: 43-46

[Hadzilacos 1982]

Vassos Hadzilacos: An Algorithm for Minimizing Roll Back Cost. PODS 1982: 93-97

[Hadzilacos 1987]

Vassos Hadzilacos: A Knowledge Theoretic Analysis of Atomic Commitment Protocols. PODS 1987: 129-134

[Haerder and Reuter 1983]

Theo Härder, Andreas Reuter: Principles of Transaction-Oriented Database Recovery. ACM Comput. Surv. 15(4): 287-317(1983)

[Hagihara et al. 1979]

Kenichi Hagihara, Minoru Ito, Kenichi Taniguchi, Tadao Kasami: Decision Problems for Multivalued Dependencies in Relational Databases. SIAM J. Comput. 8(2): 247-264(1979)

[Hall 1976]

Patrick A. V. Hall: Optimization of a Single Relation Expression in a Relational Data Base System. IBM J. Res. Dev. 20(3): 244-257(1976)

[Hammer and McLeod1981]

Michael Hammer, Dennis McLeod: Database Description with SDM: A Semantic Database Model. ACM Trans. Database Syst. 6(3): 351-386(1981)

[Hammer and Shipman 1980]

Michael Hammer, David W. Shipman: Reliability Mechanisms for SDD-1: A System for Distributed Databases. ACM Trans. Database Syst. 5(4): 431-466(1980)

[Han 1988]

Jiawei Han: Selection of Processing Strategies for Different Recursive Queries. JCDKB 1988: 59-68

[Han and Henschen 1987]

Jiawei Han, Lawrence J. Henschen: Handling Redundancy in the Processing of Recursive Database Queries. SIGMOD Conference 1987: 73-81

[Harel 1986]

...

[Heath 1971]

I. J. Heath: Unacceptable File Operations in a Relational Data Base. SIGFIDET Workshop 1971: 19-33

[Heiler and Rosenthal 1985]

Sandra Heiler, Arnon Rosenthal: G-WHIZ, a Visual Interface for the Functional Model with Recursion. VLDB 1985: 209-218

[Held and Stonebraker 1978]

Gerald Held, Michael Stonebraker: B-trees Re-examined. Commun. ACM 21(2): 139-143(1978)

[Henschen and Naqvi 1984]

Lawrence J. Henschen, Shamim A. Naqvi: On compiling queries in recursive first-order databases. J. ACM 31(1): 47-85(1984)

[Hill 1974]

...

[Holt 1972]

Richard C. Holt: Some Deadlock Properties of Computer Systems. ACM Comput. Surv. 4(3): 179-196(1972)

[Honeyman 1980]

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

[Honeyman 1982]

Peter Honeyman: Testing satisfaction of functional dependencies. J. ACM 29(3): 668-677(1982)

[Honeyman et al. 1980]

Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis: Testing the Universal Instance Assumption. Inf. Process. Lett. 10(1): 14-19(1980)

[Hull and King 1987]

Richard Hull, Roger King: Semantic Database Modeling: Survey, Applications, and Research Issues. ACM Comput. Surv. 19(3): 201-260(1987)

[Hull and Su 1988]

Richard Hull, Jianwen Su: On the Expressive Power of Database Queries with Intermediate Types. PODS 1988: 39-51

[Hull and Yap 1984]

Richard Hull, Chee-Keng Yap: The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544(1984)

[Hunt and Rosenkrantz 1979]

Harry B. Hunt III, Daniel J. Rosenkrantz: The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133

[Ibaraki and Kameda 1984]

Toshihide Ibaraki, Tiko Kameda: On the Optimal Nesting Order for Computing N-Relational Joins. ACM Trans. Database Syst. 9(3): 482-502(1984)

[IBM 1978a]

...

[IBM 1978b]

...

[IBM 1984]

...

[IBM 1985a]

...

[IBM 1985b]

...

[Imielinski 1986]

Tomasz Imielinski: Query Processing in Deductive Databases with Incomplete Information. SIGMOD Conference 1986: 268-280

[Imielinski and Lipski 1984]

Tomasz Imielinski, Witold Lipski Jr.: Incomplete Information in Relational Databases. J. ACM 31(4): 761-791(1984)

[Imielinski and Naqvi 1988]

Tomasz Imielinski, Shamim A. Naqvi: Explicit Control of Logic Programs Through Rule Algebra. PODS 1988: 103-116

[Immerman 1982]

Neil Immerman: Relational Queries Computable in Polynomial Time (Extended Abstract). STOC 1982: 147-152

[Ioannidis 1986a]

...

[Ioannidis 1986b]

Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411

[Ioannidis et al. 1988]

Yannis E. Ioannidis, Joanna Chen, Mark A. Friedman, Manolis M. Tsangaris: Bermuda - An Architectural Perspective on Interfacing Prolog to a Database Machine. Expert Database Conf. 1988: 229-255

[Ioannidis and Ramakrishnan 1988]

Yannis E. Ioannidis, Raghu Ramakrishnan: Efficient Transitive Closure Algorithms. VLDB 1988: 382-394

[Ioannidis and Wong 1987a]

Yannis E. Ioannidis, Eugene Wong: Query Optimization by Simulated Annealing. SIGMOD Conference 1987: 9-22

[Ioannidis and Wong 1987b]

Yannis E. Ioannidis, Eugene Wong: An Algebraic Approach to Recursive Inference. Expert Database Conf. 1986: 295-309

[Ioannidis and Wong 1988]

Yannis E. Ioannidis, Eugene Wong: Transforming Nonlinear Recursion into Linear Recursion. Expert Database Conf. 1988: 401-421

[Jaeschke and Scheck 1982]

Gerhard Jaeschke, Hans-Jörg Schek: Remarks on the Algebra of Non First Normal Form Relations. PODS 1982: 124-138

[Jagadish et al. 1987]

H. V. Jagadish, Rakesh Agrawal, Linda Ness: A Study of Transitive Closure As a Recursion Mechanism. SIGMOD Conference 1987: 331-344

[Jarke et al. 1984]

Matthias Jarke, James Clifford, Yannis Vassiliou: An Optimizing Prolog Front-End to a Relational Query System. SIGMOD Conference 1984: 296-306

[Jarke and Koch 1984]

Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)

[Johnson and Klug 1983a]

David S. Johnson, Anthony C. Klug: Optimizing Conjunctive Queries that Contain Untyped Variables. SIAM J. Comput. 12(4): 616-640(1983)

[Johnson and Klug 1983b]

David S. Johnson, Anthony C. Klug: Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. J. Comput. Syst. Sci. 28(1): 167-189(1984)

[Jou and Fischer 1983]

Jiann H. Jou, Patrick C. Fischer: The Complexity of Recognizing 3NF Relation Schemes. Inf. Process. Lett. 14(4): 187-190(1982)

[Kambayashi 1978]

...

[Kambayashi 1981]

...

[Kanellakis 1986]

...

[Kanellakis et al. 1983]

Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi: Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract). STOC 1983: 264-277

[Kanellakis and Papadimitriou 1981]

Paris C. Kanellakis, Christos H. Papadimitriou: The Complexity of Distributed Concurrency Control. FOCS 1981: 185-197

[Kanellakis and Papadimitriou 1984]

Paris C. Kanellakis, Christos H. Papadimitriou: Is Distributed Locking Harder? J. Comput. Syst. Sci. 28(1): 103-120(1984)

[Kedem and Silberschatz 1979]

Zvi M. Kedem, Abraham Silberschatz: Controlling Concurrency Using Locking Protocols (Preliminary Report). FOCS 1979: 274-285

[Kedem and Silberschatz 1980]

Zvi M. Kedem, Abraham Silberschatz: Non-Two-Phase Locking Protocols with Shared and Exclusive Locks. VLDB 1980: 309-317

[Keller 1985]

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

[Kellogg et al. 1986]

Charles Kellogg, Anthony B. O'Hare, Larry Travis: Optimizing the Rule-Data Interface in a KMS. VLDB 1986: 42-51

[Kemp and Topor 1988]

David B. Kemp, Rodney W. Topor: Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases. ICLP/SLP 1988: 178-194

[Kent 1979]

William Kent: Limitations of Record-Based Information Models. ACM Trans. Database Syst. 4(1): 107-131(1979)

[Kent 1981]

William Kent: Consequences of Assuming a Universal Relation. ACM Trans. Database Syst. 6(4): 539-556(1981)

[Kent 1983]

William Kent: The Universal Relation Revisited. ACM Trans. Database Syst. 8(4): 644-648(1983)

[Kerschberg 1987]

Larry Kerschberg (Ed.): Expert Database Systems, Proceedings From the First International Conference, Charleston, South Carolina, USA, April 1-4, 1986. Benjamin/Cummings 1987, ISBN 0-8053-3271-5
Contents

[Kerschberg et al. 1977]

Larry Kerschberg, Anthony C. Klug, Dennis Tsichritzis: A Taxonomy of Data Models. VLDB 1976: 43-64

[Khoshafian and Copeland 1986]

Setrag Khoshafian, George P. Copeland: Object Identity. OOPSLA 1986: 406-416

[Kifer and Lozinskii 1985]

...

[Kifer et al. 1988]

Michael Kifer, Raghu Ramakrishnan, Abraham Silberschatz: An Axiomatic Approach to Deciding Query Safety in Deductive Databases. PODS 1988: 52-60

[Kim 1979]

Won Kim: Relational Database Systems. ACM Comput. Surv. 11(3): 187-211(1979)

[Kim 1981]

Won Kim: On Optimizing an SQL-like Nested Query. ACM Trans. Database Syst. 7(3): 443-469(1982)

[Kleene 1956]

...

[Klug 1981]

Anthony C. Klug: Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. J. ACM 29(3): 699-717(1982)

[Klug 1988]

Anthony C. Klug: On conjunctive queries containing inequalities. J. ACM 35(1): 146-160(1988)

[Knuth 1968]

Donald E. Knuth: The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley 1968

[Knuth 1973]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X

[Kolaitis 1987]

Phokion G. Kolaitis: The Expressive Power of Stratified Programs. Inf. Comput. 90(1): 50-66(1991)

[Kolaitis and Papadimitriou 1988]

Phokion G. Kolaitis, Christos H. Papadimitriou: Why Not Negation by Fixpoint? PODS 1988: 231-239

[Korth 1983]

Henry F. Korth: Locking Primitives in a Database System. J. ACM 30(1): 55-79(1983)

[Korth et al. 1984]

Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman: System/U: A Database System Based on the Universal Relation Assumption. ACM Trans. Database Syst. 9(3): 331-347(1984)

[Korth and Silberschatz 1986]

Abraham Silberschatz, Henry F. Korth: Database System Concepts, 1st Edition. McGraw-Hill Book Company 1986, ISBN 0-07-100529-3

[Kowalski 1974]

Robert A. Kowalski: Predicate Logic as Programming Language. IFIP Congress 1974: 569-574

[Kowalski 1975]

Robert A. Kowalski: A Proof Procedure Using Connection Graphs. J. ACM 22(4): 572-595(1975)

[Kowalksi 1988]

Robert A. Kowalski: The Early Years of Logic Programming. Commun. ACM 31(1): 38-43(1988)

[Kowalski and Kuehner 1971]

Robert A. Kowalski, Donald Kuehner: Linear Resolution with Selection Function. Artif. Intell. 2(3/4): 227-260(1971)

[Krishnamurthy et al. 1986]

Ravi Krishnamurthy, Haran Boral, Carlo Zaniolo: Optimization of Nonrecursive Queries. VLDB 1986: 128-137

[Krishnamurthy et al. 1988]

Ravi Krishnamurthy, Raghu Ramakrishnan, Oded Shmueli: A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). SIGMOD Conference 1988: 154-163

[Kuck and Sagiv 1982]

Sharon McCure Kuck, Yehoshua Sagiv: A Universal Relation Database System Implemented via the Network Model. PODS 1982: 147-157

[Kuhns 1967]

...

[Kung and Papadimitriou 1979]

H. T. Kung, Christos H. Papadimitriou: An Optimality Theory of Concurrency Control for Databases. SIGMOD Conference 1979: 116-126

[Kung and Robinson 1981]

H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981)

[Kunifuji and Yokuta 1982]

...

[Kuper 1987]

Gabriel M. Kuper: Logic Programming With Sets. PODS 1987: 11-20

[Kuper 1988]

Gabriel M. Kuper: On the Expressive Power of Logic Programming Languages with Sets. PODS 1988: 10-14

[Kuper and Vardi 1984]

Gabriel M. Kuper, Moshe Y. Vardi: A New Approach to Database Logic. PODS 1984: 86-96

[Kuper and Vardi 1985]

Gabriel M. Kuper, Moshe Y. Vardi: On the Expressive Power of the Logical Data Model (Preliminary Report). SIGMOD Conference 1985: 180-187

[Lacroix and Pirotte 1976]

...

[Lamport 1978]

Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565(1978)

[Lampson and Sturgis 1976]

...

[Larson 1978]

Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978)

[Larson 1982]

Per-Åke Larson: Performance Analysis of Linear Hashing with Partial Expansions. ACM Trans. Database Syst. 7(4): 566-587(1982)

[Laver et al. 1983]

Kent Laver, Alberto O. Mendelzon, Marc H. Graham: Functional Dependencies on Cyclic Database Schemes. SIGMOD Conference 1983: 79-91

[Lee et al. 1988]

Mavis K. Lee, Johann Christoph Freytag, Guy M. Lohman: Implementing an Interpreter for Functional Rules in a Query Optimizer. VLDB 1988: 218-229

[Lehmann 1977]

Daniel J. Lehmann: Algebraic Structures for Transitive Closure. Theor. Comput. Sci. 4(1): 59-76(1977)

[Lehman and Yao 1981]

Philip L. Lehman, S. Bing Yao: Efficient Locking for Concurrent Operations on B-Trees. ACM Trans. Database Syst. 6(4): 650-670(1981)

[Levien 1969]

...

[Levien and Maron 1967]

...

[Le 1985]

Van Tu Le: General Failure of Logic Programs. J. Log. Program. 2(2): 157-165(1985)

[Lien 1979]

Y. Edmund Lien: Multivalued Dependencies with Null Values in Relational Data Bases. VLDB 1979: 61-66

[Lien 1982]

Y. Edmund Lien: On the Equivalence of Database Models. J. ACM 29(2): 333-362(1982)

[Lifschitz 1985]

Vladimir Lifschitz: Closed-World Databases and Circumscription. Artif. Intell. 27(2): 229-235(1985)

[Lifschitz 1988]

Vladimir Lifschitz: On the Declarative Semantics of Logic Programs with Negation. Foundations of Deductive Databases and Logic Programming. 1988: 177-192

[Ling et al. 1981]

Tok Wang Ling, Frank Wm. Tompa, Tiko Kameda: An Improved Third Normal Form for Relational Databases. ACM Trans. Database Syst. 6(2): 329-346(1981)

[Lipski 1981]

Witold Lipski Jr.: On Databases with Incomplete Information. J. ACM 28(1): 41-70(1981)

[Lipski and Papadimitriou 1981]

Witold Lipski Jr., Christos H. Papadimitriou: A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. J. Algorithms 2(3): 211-226(1981)

[Litwin 1980]

Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223

[Litwin 1984]

Witold Litwin: MALPHA: A Relational Multidatabase Manipulation Language. ICDE 1984: 86-93

[Liu and Demers 1980]

Lishing Liu, Alan J. Demers: An Algorithm for Testing Lossless Join Property in Relational Databases. Inf. Process. Lett. 11(2): 73-76(1980)

[Lloyd 1984]

John W. Lloyd: Foundations of Logic Programming, 1st Edition. Springer 1984, ISBN 3-540-13299-6

[Lohman 1988]

Guy M. Lohman: Grammar-like Functional Rules for Representing Query Optimization Alternatives. SIGMOD Conference 1988: 18-27

[Lohman et al. 1984]

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

[Lorie 1977]

Raymond A. Lorie: Physical Integrity in a Large Segmented Database. ACM Trans. Database Syst. 2(1): 91-104(1977)

[Lozinskii 1985]

Eliezer L. Lozinskii: Evaluating Queries in Deductive Databases by Generating. IJCAI 1985: 173-177

[Lucchesi and Osborn 1978]

Claudio L. Lucchesi, Sylvia L. Osborn: Candidate Keys for Relations. J. Comput. Syst. Sci. 17(2): 270-279(1978)

[Lueker 1978]

George S. Lueker: A Data Structure for Orthogonal Range Queries. FOCS 1978: 28-34

[Lu et al. 1987]

Hongjun Lu, Krishna P. Mikkilineni, James P. Richardson: Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation. ICDE 1987: 112-119

[Lum and Ling 1970]

Vincent Y. Lum: Multi-Attribute Retrieval with Combined Indexes. Commun. ACM 13(11): 660-665(1970)

[Mackert and Lohman 1986]

Lothar F. Mackert, Guy M. Lohman: R* Optimizer Validation and Performance Evaluation for Local Queries. SIGMOD Conference 1986: 84-95

[Maher 1986]

Michael J. Maher: Eqivalences of Logic Programs. ICLP 1986: 410-424

[Maier 1980]

David Maier: Minimum Covers in Relational Database Model. J. ACM 27(4): 664-674(1980)

[Maier 1983]

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

[Maier 1986]

...

[Maier et al. 1980]

David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman: Adequacy of Decompositions of Relational Databases. J. Comput. Syst. Sci. 21(3): 368-379(1980)

[Maier et al. 1979]

David Maier, Alberto O. Mendelzon, Yehoshua Sagiv: Testing Implications of Data Dependencies. ACM Trans. Database Syst. 4(4): 455-469(1979)

[Maier et al. 1986]

David Maier, David Rozenshtein, David Scott Warren: Window Functions. Advances in Computing Research 3: 213-246(1986)

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

[Maier et al. 1986]

David Maier, Jacob Stein, Allen Otis, Alan Purdy: Development of an Object-Oriented DBMS. OOPSLA 1986: 472-482

[Maier and Ullman 1983a]

David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14(1983)

[Maier and Ullman 1983b]

David Maier, Jeffrey D. Ullman: Fragments of Relations. SIGMOD Conference 1983: 15-22

[Maier et al. 1984]

David Maier, Jeffrey D. Ullman, Moshe Y. Vardi: On the Foundations of the Universal Relation Model. ACM Trans. Database Syst. 9(2): 283-308(1984)

[Maier and Warren 1988]

David Maier, David Scott Warren: Computing with Logic: Logic Programming with Prolog. Benjamin/Cummings 1988, ISBN 0-8053-6681-4

[Malvestuto 1986]

Francesco M. Malvestuto: Modelling Large Bases of Categorial Data With Acyclic Schemes. ICDT 1986: 323-340

[Manber and Ladner 1984]

Udi Manber, Richard E. Ladner: Concurrency Control In a Dynamic Search Structure. ACM Trans. Database Syst. 9(3): 439-455(1984)

[Manna and Waldinger 1985]

...

[Marchetti-Spaccamela et al. 1987]

Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Worst-case Complexity Analysis of Methods for Logic Query Implementation. PODS 1987: 294-301

[Maurer and Lewis 1975]

W. D. Maurer, T. G. Lewis: Hash Table Methods. ACM Comput. Surv. 7(1): 5-19(1975)

[McCarthy 1980]

John McCarthy: Circumscription - A Form of Non-Monotonic Reasoning. Artif. Intell. 13(1-2): 27-39(1980)

[McKay and Shapiro 1981]

...

[McLean 1981]

Gordon McLean Jr.: Comments on SDD-1 Concurrency Control Mechanisms. ACM Trans. Database Syst. 6(2): 347-350(1981)

[Menasce and Muntz 1979]

Daniel A. Menascé, Richard R. Muntz: Locking and Deadlock Detection in Distributed Data Bases. IEEE Trans. Software Eng. 5(3): 195-202(1979)

[Menasce et al. 1980]

Daniel A. Menascé, Richard R. Muntz: Locking and Deadlock Detection in Distributed Data Bases. IEEE Trans. Software Eng. 5(3): 195-202(1979)

[Mendelzon 1979]

Alberto O. Mendelzon: On Axiomatizing Multivalued Dependencies in Relational Databases. J. ACM 26(1): 37-44(1979)

[Mendelzon 1984]

Alberto O. Mendelzon: Database States and Their Tableaux. ACM Trans. Database Syst. 9(2): 264-282(1984)

[Mendelzon 1985]

Alberto O. Mendelzon: Functional Dependencies in Logic Programs. VLDB 1985: 324-330

[Mendelzon and Maier 1979]

Alberto O. Mendelzon, David Maier: Generalized Mutual Dependencies and the Decomposition of Database Relations. VLDB 1979: 75-82

[Minker 1978]

Jack Minker: Search Strategy and Selection Function for an Inferential Relational System. ACM Trans. Database Syst. 3(1): 1-31(1978)

[Minker 1982]

Jack Minker: On Indefinite Databases and the Closed World Assumption. CADE 1982: 292-308

[Minker 1987]

Jack Minker: Perspectives in Deductive Databases. J. Log. Program. 5(1): 33-60(1988)

[Minker 1988]

Jack Minker (Ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann 1988, ISBN 0-934613-40-0
Contents

[Minker and Nicolas 1981]

Jack Minker, Jean-Marie Nicolas: On recursive axioms in deductive databases. Inf. Syst. 8(1): 1-13(1983)

[Minoura 1980]

...

[Minsky and Rozenshtein 1987]

Naftaly H. Minsky, David Rozenshtein: A Law-Based Approach to Object-Oriented Programming. OOPSLA 1987: 482-493

[Mitchell 1983]

John C. Mitchell: Inference Rules for Functional and Inclusion Dependencies. PODS 1983: 58-69

[Moffat and Gray 1986]

David S. Moffat, Peter M. D. Gray: Interfacing Prolog to a Persistent Data Store. ICLP 1986: 577-584

[Mohan et al. 1986]

C. Mohan, Bruce G. Lindsay, Ron Obermarck: Transaction Management in the R* Distributed Database Management System. ACM Trans. Database Syst. 11(4): 378-396(1986)

[Morris 1988]

Katherine A. Morris: An Algorithm for Ordering Subgoals in NAIL! PODS 1988: 82-88

[Morris et al. 1987]

Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder: YAWN! (Yet Another Window on NAIL!). IEEE Data Eng. Bull. 10(4): 28-43(1987)

[Morris et al. 1986]

Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder: Design Overview of the NAIL! System. ICLP 1986: 554-568

[Morris 1968]

Robert Morris: Scatter Storage Techniques. Commun. ACM 11(1): 38-44(1968)

[MRI 1978]

...

[Naish 1986]

Lee Naish: Negation and Control in Prolog. Lecture Notes in Computer Science Vol. 238 Springer 1986, ISBN 3-540-16815-X

[Napheys and Herkimer 1988]

Ben Napheys, Don Herkimer: A Look at Loosely-Coupled Prolog Database Systems. Expert Database Conf. 1988: 257-271

[Naqvi 1986]

Shamim A. Naqvi: Negation in Knowledge Base Management Systems. On Knowledge Base Management Systems (Islamorada) 1985: 125-145

[Naqvi and Krishnamurthy 1988]

Shamim A. Naqvi, Ravi Krishnamurthy: Database Updates in Logic Programming. PODS 1988: 251-262

[Naqvi and Tsur 1988]

Shamim A. Naqvi, Shalom Tsur: A Logical Language for Data and Knowledge Bases. Computer Science Press 1989, ISBN 0-7167-8200-6

[Natarajan 1987]

K. S. Natarajan: Optimizing Backtrack Search for all Solutions to Conjunctive Problems. IJCAI 1987: 955-958

[Naughton 1986a]

Jeffrey F. Naughton: Redundancy in Function-Free Recursive Rules. SLP 1986: 236-245

[Naughton 1986b]

Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. PODS 1986: 267-279

[Naughton 1987]

Jeffrey F. Naughton: One-Sided Recursions. PODS 1987: 340-348

[Naughton 1988a]

...

[Naughton 1988b]

Jeffrey F. Naughton: Compiling Separable Recursions. SIGMOD Conference 1988: 312-319

[Naughton et al. 1988]

...

[Naughton and Sagiv 1987]

Jeffrey F. Naughton, Yehoshua Sagiv: A Decidable Class of Bounded Recursions. PODS 1987: 227-236

[Neiman 1986]

...

[Nicolas 1978]

Jean-Marie Nicolas: Mutual Dependencies and Some Results on Undecomposable Relations. VLDB 1978: 360-367

[Obermarck 1982]

Ron Obermarck: Distributed Deadlock Detection Algorithm. ACM Trans. Database Syst. 7(2): 187-208(1982)

[Olle 1978]

...

[Orenstein and Merrett 1984]

Jack A. Orenstein, T. H. Merrett: A Class of Data Structures for Associative Searching. PODS 1984: 181-190

[Osborn 1977]

...

[Osborn 1979a]

Sylvia L. Osborn: Testing for Existence of a Covering Boyce-Codd normal Form. Inf. Process. Lett. 8(1): 11-14(1979)

[Osborn 1979b]

Sylvia L. Osborn: Towards a Universal Relation Interface. VLDB 1979: 52-60

[Ozsoyoglu and Wang 1987]

...

[Ozsoyoglu and Yuan 1985]

Z. Meral Özsoyoglu, Li-Yan Yuan: A Normal Form for Nested Relations. PODS 1985: 251-260

[Paige and Schwartz 1977]

Robert Paige, Jacob T. Schwartz: Reduction in Strength of High Level Operations. POPL 1977: 58-71

[Palermo 1974]

...

[Papadimitriou 1979]

Christos H. Papadimitriou: The serializability of concurrent database updates. J. ACM 26(4): 631-653(1979)

[Papadimitriou 1983]

Christos H. Papadimitriou: Concurrency Control by Locking. SIAM J. Comput. 12(2): 215-226(1983)

[Papadimitriou 1986]

Christos H. Papadimitriou: The Theory of Database Concurrency Control. Computer Science Press 1986, ISBN 0-88175-027-1

[Papadimitriou et al. 1977]

...

[Papadimitriou and Kanellakis 1984]

Christos H. Papadimitriou, Paris C. Kanellakis: On Concurrency Control by Multiple Versions. ACM Trans. Database Syst. 9(1): 89-99(1984)

[Paredaens and Jannsens 1981]

Jan Paredaens, Dirk Janssens: Decompositions of Relations: A Comprehensive Approach. Advances in Data Base Theory 1979: 73-100

[Paredaens and van Gucht 1988]

Jan Paredaens, Dirk Van Gucht: Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions. PODS 1988: 29-38

[Pecherer 1975]

Robert M. Pecherer: Efficient Evaluation of Expressions in a Relational Algebra. ACM Pacific 1975: 44-49

[Peleg 1987]

...

[Pereira and Warren 1983]

...

[Perl et al. 1978]

Yehoshua Perl, Alon Itai, Haim Avni: Interpolation Search - A Log Log N Search. Commun. ACM 21(7): 550-553(1978)

[Pirotte 1978]

Alain Pirotte: High Level Data Base Query Languages. Logic and Data Bases 1977: 409-436

[Porter 1986]

...

[Port et al. 1988]

...

[Przymusinski 1986]

Teodor C. Przymusinski: An Algorithm to Compute Circumscription. Artif. Intell. 38(1): 49-73(1989)

[Przymusinski 1988]

Teodor C. Przymusinski: On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216

[Ramakrishnan 1988]

Raghu Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. ICLP/SLP 1988: 140-159

[Ramakrishnan et al. 1987]

Raghu Ramakrishnan, François Bancilhon, Abraham Silberschatz: Safety of Recursive Horn Clauses With Infinite Relations. PODS 1987: 328-339

[Ramakrishnan et al. 1988a]

Raghu Ramakrishnan, Catriel Beeri, Ravi Krishnamurthy: Optimizing Existential Datalog Queries. PODS 1988: 89-102

[Ramakrishnan et al. 1988b]

Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181

[Ramamohanarao and Shepherd 1986]

Kotagiri Ramamohanarao, John Shepherd: A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases. ICLP 1986: 569-576

[Ramamohanarao et al. 1987]

Kotagiri Ramamohanarao, John Shepherd, Isaac Balbin, Graeme S. Port, Lee Naish, James A. Thom, Justin Zobel, Philip W. Dart: The NU-Prolog Deductive Database System. IEEE Data Eng. Bull. 10(4): 10-19(1987)

[Ramarao 1985]

K. V. S. Ramarao: On the Complexity of Commit Protocols. PODS 1985: 235-244

[Reed 1978]

...

[Reis and Stonebraker 1977]

Daniel R. Ries, Michael Stonebraker: Effects of Locking Granularity in a Database Management System. ACM Trans. Database Syst. 2(3): 233-246(1977)

[Reis and Stonebraker 1979]

Daniel R. Ries, Michael Stonebraker: Locking Granularity Revisited. ACM Trans. Database Syst. 4(2): 210-227(1979)

[Reiter 1978]

Raymond Reiter: On Closed World Data Bases. Logic and Data Bases 1977: 55-76

[Reiter 1980]

Raymond Reiter: Equality and Domain Closure in First-Order Databases. J. ACM 27(2): 235-249(1980)

[Reiter 1984]

Raymond Reiter: Towards a Logical Reconstruction of Relational Database Theory. On Conceptual Modelling (Intervale) 1982: 191-233

[Reiter 1986]

Raymond Reiter: A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM 33(2): 349-370(1986)

[Reuter 1984]

Andreas Reuter: Performance Analysis of Recovery Techniques. ACM Trans. Database Syst. 9(4): 526-559(1984)

[Rissanen 1977]

Jorma Rissanen: Independent Components of Relations. ACM Trans. Database Syst. 2(4): 317-325(1977)

[Rissanen 1979]

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

[Rivest 1976]

Ronald L. Rivest: Partial-Match Retrieval Algorithms. SIAM J. Comput. 5(1): 19-50(1976)

[Robinson 1965]

John Alan Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41(1965)

[Robinson 1981]

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

[Robinson 1986]

John T. Robinson: Order Preserving Linear Hashing Using Dynamic Key Statistics. PODS 1986: 91-99

[Rohmer et al. 1986]

J. Rohmer, R. Lescoeur, Jean-Marc Kerisit: The Alexander Method - A Technique for The Processing of Recursive Axioms in Deductive Databases. New Generation Comput. 4(3): 273-285(1986)

[Rosenberg and Snyder 1981]

Arnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193(1981)

[Rosenkrantz et al. 1978]

Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: System Level Concurrency Control for Distributed Database Systems. ACM Trans. Database Syst. 3(2): 178-198(1978)

[Rosenthal et al. 1986]

Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola: Traversal Recursion: A Practical Approach to Supporting Recursive Applications. SIGMOD Conference 1986: 166-176

[Ross and Topor 1987]

...

[Ross et al. 1988]

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS 1988: 221-230

[Roth et al. 1984]

...

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

[Rothnie and Goodman 1977]

James B. Rothnie Jr., Nathan Goodman: A Survey of Research and Development in Distributed Database Management. VLDB 1977: 48-62

[Rothnie and Lozano 1974]

James B. Rothnie Jr., Tomas Lozano: Attribute Based File Organization in a Paged Memory Environment. Commun. ACM 17(2): 63-69(1974)

[Rustin 1974]

...

[Sacca et al. 1984]

Domenico Saccà, F. Manfredi, A. Mecchia: Properties of Database Schemata with Functional Dependencies. PODS 1984: 19-28

[Sacca and Zaniolo 1986]

Domenico Saccà, Carlo Zaniolo: On the Implementation of a Simple Class of Logic Queries for Databases. PODS 1986: 16-23

[Sacca and Zaniolo 1987a]

Domenico Saccà, Carlo Zaniolo: Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic. ICLP 1987: 104-135

[Sacca and Zaniolo 1987b]

Domenico Saccà, Carlo Zaniolo: Magic Counting Methods. SIGMOD Conference 1987: 49-59

[Sacca and Zaniolo 1988]

Domenico Saccà, Carlo Zaniolo: Differential Fixpoint Methods and Stratification of Logic Programs. JCDKB 1988: 49-58

[Sacco and Schkolnick 1986]

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

[Sadri and Ullman 1981]

Fereidoon Sadri, Jeffrey D. Ullman: Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. J. ACM 29(2): 363-372(1982)

[Sagiv 1981]

Yehoshua Sagiv: Can We Use the Universal Instance Assumption Without Using Nulls? SIGMOD Conference 1981: 108-120

[Sagiv 1983]

Yehoshua Sagiv: A Characterization of Globally Consistent Databases and Their Correct Access Paths. ACM Trans. Database Syst. 8(2): 266-286(1983)

[Sagiv 1985a]

Yehoshua Sagiv: Concurrent Operations on B-Trees with Overtaking. PODS 1985: 28-37

[Sagiv 1985b]

Yehoshua Sagiv: On Computing Restricted Projections of Representative Instances. PODS 1985: 171-180

[Sagiv 1987]

Yehoshua Sagiv: Optimizing Datalog Programs. PODS 1987: 349-362

[Sagiv et al. 1981]

Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. J. ACM 28(3): 435-453(1981)

[Sagiv and Shmueli 1986]

Yehoshua Sagiv, Oded Shmueli: On Finite FD-Acyclicity. PODS 1986: 173-182

[Sagiv and Walecka 1982]

Yehoshua Sagiv, Scott F. Walecka: Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies. J. ACM 29(1): 103-117(1982)

[Sagiv and Yannakakis 1981]

Yehoshua Sagiv, Mihalis Yannakakis: Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655(1980)

[Samet 1984]

Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16(2): 187-260(1984)

[Saraiya 1988]

Yatin P. Saraiya: Linearizing Nonlinear Recursions in Polynomial Time. PODS 1989: 182-189

[Schenk and Pinkert 1977]

Kathryn L. Schenk, James R. Pinkert: An Algorithm for Servicing Multi-Relational Queries. SIGMOD Conference 1977: 10-20

[Scheuermann and Ouksel 1982]

Peter Scheuermann, Aris M. Ouksel: Multidimensional B-trees for associative searching in database systems. Inf. Syst. 7(2): 123-137(1982)

[Schkolnick and Sorenson 1981]

...

[Schkolnick and Tiberio 1985]

Mario Schkolnick, Paolo Tiberio: Estimating the Cost of Updates in a Relational Database. ACM Trans. Database Syst. 10(2): 163-179(1985)

[Schmid and Swenson 1976]

Hans Albrecht Schmid, J. Richard Swenson: On the Semantics of the Relational Data Model. SIGMOD Conference 1975: 211-223

[Schwarz et al. 1986]

Peter M. Schwarz, Walter Chang, Johann Christoph Freytag, Guy M. Lohman, John McPherson, C. Mohan, Hamid Pirahesh: Extensibility in the Starburst Database System. OODBS 1986: 85-92

[Sciore 1979]

Edward Sciore: Improving Semantic Specification in a Relational Database. SIGMOD Conference 1979: 170-178

[Sciore 1981]

Edward Sciore: Real-World MVD's. SIGMOD Conference 1981: 121-132

[Sciore 1982]

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

[Sciore 1986]

Edward Sciore: Comparing the Universal Instance and Relational Data Models. Advances in Computing Research 3: 139-162(1986)

[Sciore and Warren 1986]

Edward Sciore, David Scott Warren: Towards an Integrated Database-Prolog System. Expert Database Workshop 1984: 293-305

[Segall and Wolfson 1987]

Adrian Segall, Ouri Wolfson: Transaction Commitment at Minimal Communication Cost. PODS 1987: 112-118

[Seki 1988]

...

[Seki and Itoh 1988]

Hirohisa Seki, Hidenori Itoh: A Query Evaluation Method for Stratified Programs Under the Extended CWA. ICLP/SLP 1988: 195-211

[Selinger and Adiba 1980]

Patricia G. Selinger, Michel E. Adiba: Access Path Selection in Distributed Database Management Systems. ICOD 1980: 204-215

[Sellis 1986]

Timos K. Sellis: Global Query Optimization. SIGMOD Conference 1986: 191-205

[Semmel 1988]

...

[Servio Logic 1986]

...

[Shapiro 1986]

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

[Shepherdson 1984]

John C. Shepherdson: Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. J. Log. Program. 1(1): 51-79(1984)

[Shepherdson 1988]

John C. Shepherdson: Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming. 1988: 19-88

[Shipman 1981]

David W. Shipman: The Functional Data Model and the Data Language DAPLEX. ACM Trans. Database Syst. 6(1): 140-173(1981)

[Shmueli 1987]

Oded Shmueli: Decidability and Expressiveness of Logic Queries. PODS 1987: 237-249

[Shmueli and Naqvi 1987]

Oded Shmueli, Shamim A. Naqvi: Set Grouping and Layering in Horn Clause Programs. ICLP 1987: 152-177

[Shneiderman 1978]

...

[Sibley 1976]

Edgar H. Sibley: Guest Editor's Introduction: The Development of Data-Base Technology. ACM Comput. Surv. 8(1): 1-5(1976)