dblp.uni-trier.de www.uni-trier.de

Ullman: Principles of Database and Knowledge-Base Systems

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

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

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X BibTeX

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

BibTeX

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 BibTeX
[Abiteboul and Vianu 1988]
Serge Abiteboul, Victor Vianu: Procedural and Declarative Database Update Languages. PODS 1988: 240-250 BibTeX
[Addis 1982]
Thomas R. Addis: A Relation-Based Language Interpreter for Content Addressable File Store. ACM Trans. Database Syst. 7(2): 125-163(1982) BibTeX
[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 BibTeX
[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) BibTeX
[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 BibTeX
[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) BibTeX
[Agrawal and Jagadish 1987]
Rakesh Agrawal, H. V. Jagadish: Direct Algorithms for Computing the Transitive Closure of Database Relations. VLDB 1987: 255-266 BibTeX
[Aho et al. 1979]
Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314(1979) BibTeX
[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
BibTeX
[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
BibTeX
[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) BibTeX
[Aho et al. 1988]
Alfred V. Aho, Brian W. Kernighan, Peter J. Weinberger: The AWK Programming Language. Addison-Wesley 1988
BibTeX
[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
BibTeX
[Aho et al. 1979b]
Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979) BibTeX
[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) BibTeX
[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) BibTeX
[Aho and Ullman 1979b]
Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 BibTeX
[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) BibTeX
[Apt 1987]
Krzysztof R. Apt: Logic Programming. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 493-574 BibTeX
[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 BibTeX
[Apt and Pugin 1987]
Krzysztof R. Apt, Jean-Marc Pugin: Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987: 136-145 BibTeX
[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) BibTeX
[Armstrong 1974]
William Ward Armstrong: Dependency Structures of Data Base Relationships. IFIP Congress 1974: 580-583 BibTeX
[Arora and Carlson 1978]
Adarsh K. Arora, C. Robert Carlson: The Information Preserving Properties of Relational Database Transformations. VLDB 1978: 352-359 BibTeX
[Astrahan and Chamberlin 1975]
Morton M. Astrahan, Donald D. Chamberlin: Implementation of a Structured English Query Language. Commun. ACM 18(10): 580-588(1975) 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. 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) BibTeX
[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 BibTeX
[Atzeni and Chan 1985]
Paolo Atzeni, Edward P. F. Chan: Efficient Query Answering in the Representative Instance Approach. PODS 1985: 181-188 BibTeX
[Atzeni and DeBernardis 1987]
Paolo Atzeni, Maria Cristina De Bernardis: A New Basis for the Weak Instance Model. PODS 1987: 79-86 BibTeX
[Atzeni and Parker 1982]
Paolo Atzeni, Douglas Stott Parker Jr.: Assumptions in Relational Database Theory. PODS 1982: 1-9 BibTeX
[Bachman 1969]
...
[Badal 1980]
Dushan Z. Badal: The Analysis of the Effects of Concurrency Control on Distributed Database System Performance. VLDB 1980: 376-383 BibTeX
[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) BibTeX
[Bancilhon 1986b]
François Bancilhon: Naive Evaluation of Recursively Defined Relations. On Knowledge Base Management Systems (Islamorada) 1985: 165-178 BibTeX
[Bancilhon and Khoshafian 1986]
François Bancilhon, Setrag Khoshafian: A Calculus for Complex Objects. PODS 1986: 53-60 BibTeX
[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 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
[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) BibTeX
[Batory 1988]
Don S. Batory: Concepts for a Database System Compiler. PODS 1988: 184-192 BibTeX
[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) BibTeX
[Bayer 1985]
...
[Bayer et al. 1980]
Rudolf Bayer, Klaus Elhardt, Hans Heller, Angelika Reiser: Distributed Concurrency Control in Database Systems. VLDB 1980: 275-284 BibTeX
[Bayer and McCreight 1972]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX
[Bayer and Schkolnick 1977]
Rudolf Bayer, Mario Schkolnick: Concurrency of Operations on B-Trees. Acta Inf. 9: 1-21(1977) BibTeX
[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) BibTeX
[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) BibTeX
[Beeri et al. 1978]
Catriel Beeri, Philip A. Bernstein, Nathan Goodman: A Sophisticate's Introduction to Database Normalization Theory. VLDB 1978: 113-124 BibTeX
[Beeri et al. 1983]
Catriel Beeri, Philip A. Bernstein, Nathan Goodman: A Concurrency Control Theory for Nested Transactions. PODC 1983: 45-62 BibTeX
[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 BibTeX
[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) BibTeX
[Beeri and Honeyman 1981]
Catriel Beeri, Peter Honeyman: Preserving Functional Dependencies. SIAM J. Comput. 10(3): 647-656(1981) BibTeX
[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 BibTeX
[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) BibTeX
[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 BibTeX
[Beeri and Ramakrishnan 1987]
Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. PODS 1987: 269-284 BibTeX
[Beeri and Vardi 1981]
Catriel Beeri, Moshe Y. Vardi: The Implication Problem for Data Dependencies. ICALP 1981: 73-85 BibTeX
[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) BibTeX
[Beeri and Vardi 1984b]
Catriel Beeri, Moshe Y. Vardi: A Proof Procedure for Data Dependencies. J. ACM 31(4): 718-741(1984) BibTeX
[Bentley 1975]
Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX
[Bentley and Friedman 1979]
Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) BibTeX
[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) BibTeX
[Bernstein 1976]
Philip A. Bernstein: Synthesizing Third Normal Form Relations from Functional Dependencies. ACM Trans. Database Syst. 1(4): 277-298(1976) BibTeX
[Bernstein and Chiu 1981]
Philip A. Bernstein, Dah-Ming W. Chiu: Using Semi-Joins to Solve Relational Queries. J. ACM 28(1): 25-40(1981) BibTeX
[Bernstein and Goodman 1980a]
Philip A. Bernstein, Nathan Goodman: What does Boyce-Codd Normal Form Do? VLDB 1980: 245-259 BibTeX
[Bernstein and Goodman 1980b]
Philip A. Bernstein, Nathan Goodman: Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems. VLDB 1980: 285-300 BibTeX
[Bernstein and Goodman 1981a]
Philip A. Bernstein, Nathan Goodman: Power of Natural Semijoins. SIAM J. Comput. 10(4): 751-771(1981) BibTeX
[Bernstein and Goodman 1981b]
Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX
[Bernstein and Goodman 1983]
Philip A. Bernstein, Nathan Goodman: Multiversion Concurrency Control - Theory and Algorithms. ACM Trans. Database Syst. 8(4): 465-483(1983) BibTeX
[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) BibTeX
[Bernstein et al. 1983]
Philip A. Bernstein, Nathan Goodman, Vassos Hadzilacos: Recovery Algorithms for Database Systems. IFIP Congress 1983: 799-807 BibTeX
[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) 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
[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) BibTeX
[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) BibTeX
[Bidoit and Hull 1986]
Nicole Bidoit, Richard Hull: Positivism vs. Minimalism in Deductive Databases. PODS 1986: 123-132 BibTeX
[Biliris 1987]
Alexandros Biliris: Operation Specific Locking in B-Trees. PODS 1987: 159-169 BibTeX
[Biskup 1980]
Joachim Biskup: Inferences of Multivalued Dependencies in Fixed and Undetermined Universes. Theor. Comput. Sci. 10: 93-105(1980) BibTeX
[Biskup and Brüggemann 1983]
Joachim Biskup, Hans Hermann Brüggemann: Universal Relation Views: A Pragmatic Approach. VLDB 1983: 172-185 BibTeX
[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 BibTeX
[Biskup et al. 1979]
Joachim Biskup, Umeshwar Dayal, Philip A. Bernstein: Synthesizing Independent Database Schemas. SIGMOD Conference 1979: 143-151 BibTeX
[Biskup and Stiefeling 1988]
Joachim Biskup, Holger Stiefeling: Transitive Closure Algorithms for Very Large Databases. WG 1988: 122-147 BibTeX
[Bitton et al. 1983]
Dina Bitton, Haran Boral, David J. DeWitt, W. Kevin Wilkinson: Parallel Algorithms for the Execution of Relational Database Operations. ACM Trans. Database Syst. 8(3): 324-353(1983) BibTeX
[Blasgen 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) BibTeX
[Bocca 1986]
Jorge B. Bocca: EDUCE: A Marriage of Convenience: Prolog and a Relational DBMS. SLP 1986: 36-45 BibTeX
[Bolour 1979]
Azad Bolour: Optimality Properties of Multiple-Key Hashing Functions. J. ACM 26(2): 196-210(1979) BibTeX
[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) BibTeX
[Brodie 1984]
Michael L. Brodie: On the Development of Data Models. On Conceptual Modelling (Intervale) 1982: 19-47 BibTeX
[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 BibTeX
[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) BibTeX
[Buckley and Silberschatz 1985]
Gael N. Buckley, Abraham Silberschatz: Beyond Two-Phase Locking. J. ACM 32(2): 314-326(1985) BibTeX
[Burkhard 1976]
Walter A. Burkhard: Hashing and Trie Algorithms for Partial Match Retrieval. ACM Trans. Database Syst. 1(2): 175-187(1976) BibTeX
[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) BibTeX
[Cardenas 1979]
...
[Carey 1983]
Michael J. Carey: Granularity Hierarchies in Concurrency Control. PODS 1983: 156-165 BibTeX
[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 BibTeX
[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 BibTeX
[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) BibTeX
[Ceri et al. 1987]
Stefano Ceri, Georg Gottlob, Gio Wiederhold: Interfacing Relational Databases and Prolog Efficiently. Expert Database Conf. 1986: 207-223 BibTeX
[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
BibTeX
[Chakravarthy and Minker 1986]
Upen S. Chakravarthy, Jack Minker: Multiple Query Processing in Deductive Databases using Query Graphs. VLDB 1986: 384-391 BibTeX
[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) BibTeX
[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) BibTeX
[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) BibTeX
[Chandra 1988]
Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9 BibTeX
[Chandra and Harel 1980]
Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980) BibTeX
[Chandra and Harel 1982]
Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128(1982) BibTeX
[Chandra and Harel 1985]
Ashok K. Chandra, David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15(1985) BibTeX
[Chandra et al. 1981]
Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky: Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354 BibTeX
[Chandra and Merlin 1977]
Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 BibTeX
[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) BibTeX
[Chan 1984]
Edward P. F. Chan: Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. SIGMOD Conference 1984: 149-163 BibTeX
[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 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
[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) BibTeX
[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) BibTeX
[Cincom 1978]
...
[Clark 1978]
Keith L. Clark: Negation as Failure. Logic and Data Bases 1977: 293-322 BibTeX
[Clocksin and Mellish 1981]
W. F. Clocksin, Chris Mellish: Programming in Prolog. Springer 1981
BibTeX
[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) BibTeX
[Codd 1972a]
E. F. Codd: Further Normalization of the Data Base Relational Model. IBM Research Report, San Jose, California RJ909: (1971) BibTeX
[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) BibTeX
[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) BibTeX
[Codd 1988]
E. F. Codd: `Universal' Relation Fails to Replace Relational Model (letter to the editor). IEEE Software 5(4): 4-6(1988) BibTeX
[Comer 1978]
Douglas Comer: The Difficulty of Optimum Index Selection. ACM Trans. Database Syst. 3(4): 440-445(1978) BibTeX
[Comer 1979]
Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
[Cooper 1980]
Eric C. Cooper: On the Expressive Power of Query Languages for Relational Databases. POPL 1982: 361-365 BibTeX
[Cosmadakis and Afrati 1988]
Foto N. Afrati, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126 BibTeX
[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 BibTeX
[Cosmadakis and Kanellakis 1986]
Stavros S. Cosmadakis, Paris C. Kanellakis: Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293 BibTeX
[Cruz and Norvell 1988]
Isabel F. Cruz, Theodore S. Norvell: Aggregative Closure: An Extension of Transitive Closure. ICDE 1989: 384-391 BibTeX
[Culik et al. 1981]
Karel Culik II, Thomas Ottmann, Derick Wood: Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512(1981) BibTeX
[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 BibTeX
[Date 1986]
C. J. Date: An Introduction to Database Systems, Volume I, 4th Edition. Addison-Wesley 1986
BibTeX
[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) BibTeX
[Davidson 1984]
Susan B. Davidson: Optimism and Consistency In Partitioned Distributed Database Systems. ACM Trans. Database Syst. 9(3): 456-481(1984) BibTeX
[Dayal and Bernstein 1978]
Umeshwar Dayal, Philip A. Bernstein: On the Updatability of Relational Views. VLDB 1978: 368-377 BibTeX
[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) BibTeX
[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 BibTeX
[Debray and Warren 1986]
Saumya K. Debray, David Scott Warren: Automatic Mode Inference for Prolog Programs. SLP 1986: 78-88 BibTeX
[Delobel 1978]
Claude Delobel: Normalization and Hierarchical Dependencies in the Relational Data Model. ACM Trans. Database Syst. 3(3): 201-222(1978) BibTeX
[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) BibTeX
[DeWitt and Gerber 1985]
David J. DeWitt, Robert H. Gerber: Multiprocessor Hash-Based Join Algorithms. VLDB 1985: 151-164 BibTeX
[Dietrich 1987]
Suzanne W. Dietrich: Extension Tables: Memo Relations in Logic Programming. SLP 1987: 264-272 BibTeX
[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) BibTeX
[Dwork and Skeen 1983]
Cynthia Dwork, Dale Skeen: The Inherent Cost of Nonblocking Commitment. PODC 1983: 1-11 BibTeX
[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) BibTeX
[Earley 1970]
Jay Earley: An Efficient Context-Free Parsing Algorithm. Commun. ACM 13(2): 94-102(1970) BibTeX
[El Abadi and Toueg 1986]
Amr El Abbadi, Sam Toueg: Availability in Partitioned Replicated Databases. PODS 1986: 240-251 BibTeX
[Ellis 1980]
Carla Schlatter Ellis: Concurrent Search and Insertion in 2-3 Trees. Acta Inf. 14: 63-86,(1980) BibTeX
[Ellis 1987]
Carla Schlatter Ellis: Concurrency in Linear Hashing. ACM Trans. Database Syst. 12(2): 195-217(1987) BibTeX
[El Masri and Wiederhold 1979]
Ramez Elmasri, Gio Wiederhold: Data Model Integration Using the Structural Model. SIGMOD Conference 1979: 191-202 BibTeX
[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 BibTeX
[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) BibTeX
[Fagin 1977]
Ronald Fagin: Multivalued Dependencies and a New Normal Form for Relational Databases. ACM Trans. Database Syst. 2(3): 262-278(1977) BibTeX
[Fagin 1978]
Ronald Fagin: On an Authorization Mechanism. ACM Trans. Database Syst. 3(3): 310-319(1978) BibTeX
[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) BibTeX
[Fagin 1982]
Ronald Fagin: Horn clauses and database dependencies. J. ACM 29(4): 952-985(1982) BibTeX
[Fagin 1983]
Ronald Fagin: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. ACM 30(3): 514-550(1983) BibTeX
[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) 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
[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 BibTeX
[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) BibTeX
[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) BibTeX
[Fischer and van Gucht 1984]
Patrick C. Fischer, Dirk Van Gucht: Weak Multivalued Dependencies. PODS 1984: 266-274 BibTeX
[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) BibTeX
[Fong and Ullman 1976]
Amelia C. Fong, Jeffrey D. Ullman: Induction Variables in Very High Level Languages. POPL 1976: 104-112 BibTeX
[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) BibTeX
[Fredman 1981]
Michael L. Fredman: A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705(1981) BibTeX
[Freytag 1987]
Johann Christoph Freytag: A Rule-Based View of Query Optimization. SIGMOD Conference 1987: 173-180 BibTeX
[Frost 1986]
Richard A. Frost: Introduction to Knowledge Base Systems. Collins 1986, ISBN 0-00-383114-0
BibTeX
[Furtado 1978]
Antonio L. Furtado: Formal aspects of the relational model. Inf. Syst. 3(2): 131-140(1978) BibTeX
[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 BibTeX
[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) BibTeX
[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 BibTeX
[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 BibTeX
[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 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
[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) BibTeX
[Garcia-Molina and Kent 1985]
Jack Kent, Hector Garcia-Molina, Jae Chung: An Experimental Evaluation of Crash Recovery Mechanisms. PODS 1985: 113-122 BibTeX
[Gardarin and Maindreville 1986]
Georges Gardarin, Christophe de Maindreville: Evaluation of Database Recursive Logic Programs as Recurrent Function Series. SIGMOD Conference 1986: 177-186 BibTeX
[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
BibTeX
[Gelenbe and Derochette 1978]
Erol Gelenbe, D. Derochette: Performance of Rollback Recovery Systems under Intermittent Failures. Commun. ACM 21(6): 493-499(1978) BibTeX
[Gelfond and Lifschitz 1988]
Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080 BibTeX
[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 BibTeX
[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) BibTeX
[Goldberg and Robson 1980]
Adele Goldberg, David Robson: Smalltalk-80: The Language and Its Implementation. Addison-Wesley 1983
BibTeX
[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) BibTeX
[Goodman and Shmueli 1983]
Nathan Goodman, Oded Shmueli: Syntactic Characterization of Tree Database Schemas. J. ACM 30(4): 767-786(1983) BibTeX
[Gotlieb and Tompa 1973]
C. C. Gotlieb, Frank Wm. Tompa: Choosing a Storage Schema. Acta Inf. 3: 297-319(1974) BibTeX
[Gotlieb 1975]
Leo R. Gotlieb: Computing Joins of Relations. SIGMOD Conference 1975: 55-63 BibTeX
[Gottlob 1987]
Georg Gottlob: Computing Covers for Embedded Functional Dependencies. PODS 1987: 58-69 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 and DeWitt 1987]
Goetz Graefe, David J. DeWitt: The EXODUS Optimizer Generator. SIGMOD Conference 1987: 160-172 BibTeX
[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) BibTeX
[Graham and Yannakakis 1984]
Marc H. Graham, Mihalis Yannakakis: Independent Database Schemas. J. Comput. Syst. Sci. 28(1): 121-141(1984) BibTeX
[Grahne and Raiha 1986]
Gösta Grahne, Kari-Jouko Räihä: Characterizations for Acyclic Database Schemes. Advances in Computing Research 3: 19-41(1986) BibTeX
[Gray 1978]
Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 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
[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 BibTeX
[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 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 BibTeX
[Greenblatt and Waxman 1978]
David Greenblatt, Jerry Waxman: A Study of Three Database Query Languages. JCDKB 1978: 77-97 BibTeX
[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 BibTeX
[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) BibTeX
[Gudes and Tsur 1980]
Ehud Gudes, Shalom Tsur: Experiments with B-Tree Reorganization. SIGMOD Conference 1980: 200-206 BibTeX
[Gruevich and Lewis 1982]
Yuri Gurevich, Harry R. Lewis: The Inference Problem for Template Dependencies. PODS 1982: 221-229 BibTeX
[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 BibTeX
[Hadzilacos and Papadimitriou 1985]
Thanasis Hadzilacos, Christos H. Papadimitriou: Algorithmic Aspects of Multiversion Concurrency Control. PODS 1985: 96-104 BibTeX
[Hadzilacos and Yannakakis 1986]
Thanasis Hadzilacos, Mihalis Yannakakis: Deleting Completed Transactions. PODS 1986: 43-46 BibTeX
[Hadzilacos 1982]
Vassos Hadzilacos: An Algorithm for Minimizing Roll Back Cost. PODS 1982: 93-97 BibTeX
[Hadzilacos 1987]
Vassos Hadzilacos: A Knowledge Theoretic Analysis of Atomic Commitment Protocols. PODS 1987: 129-134 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
[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) BibTeX
[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) BibTeX
[Hammer and McLeod1981]
Michael Hammer, Dennis McLeod: Database Description with SDM: A Semantic Database Model. ACM Trans. Database Syst. 6(3): 351-386(1981) BibTeX
[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) BibTeX
[Han 1988]
Jiawei Han: Selection of Processing Strategies for Different Recursive Queries. JCDKB 1988: 59-68 BibTeX
[Han and Henschen 1987]
Jiawei Han, Lawrence J. Henschen: Handling Redundancy in the Processing of Recursive Database Queries. SIGMOD Conference 1987: 73-81 BibTeX
[Harel 1986]
...
[Heath 1971]
I. J. Heath: Unacceptable File Operations in a Relational Data Base. SIGFIDET Workshop 1971: 19-33 BibTeX
[Heiler and Rosenthal 1985]
Sandra Heiler, Arnon Rosenthal: G-WHIZ, a Visual Interface for the Functional Model with Recursion. VLDB 1985: 209-218 BibTeX
[Held and Stonebraker 1978]
Gerald Held, Michael Stonebraker: B-trees Re-examined. Commun. ACM 21(2): 139-143(1978) BibTeX
[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) BibTeX
[Hill 1974]
...
[Holt 1972]
Richard C. Holt: Some Deadlock Properties of Computer Systems. ACM Comput. Surv. 4(3): 179-196(1972) BibTeX
[Honeyman 1980]
Peter Honeyman: Extension Joins. VLDB 1980: 239-244 BibTeX
[Honeyman 1982]
Peter Honeyman: Testing satisfaction of functional dependencies. J. ACM 29(3): 668-677(1982) BibTeX
[Honeyman et al. 1980]
Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis: Testing the Universal Instance Assumption. Inf. Process. Lett. 10(1): 14-19(1980) 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
[Hull and Su 1988]
Richard Hull, Jianwen Su: On the Expressive Power of Database Queries with Intermediate Types. PODS 1988: 39-51 BibTeX
[Hull and Yap 1984]
Richard Hull, Chee-Keng Yap: The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544(1984) BibTeX
[Hunt and Rosenkrantz 1979]
Harry B. Hunt III, Daniel J. Rosenkrantz: The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133 BibTeX
[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) BibTeX
[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 BibTeX
[Imielinski and Lipski 1984]
Tomasz Imielinski, Witold Lipski Jr.: Incomplete Information in Relational Databases. J. ACM 31(4): 761-791(1984) BibTeX
[Imielinski and Naqvi 1988]
Tomasz Imielinski, Shamim A. Naqvi: Explicit Control of Logic Programs Through Rule Algebra. PODS 1988: 103-116 BibTeX
[Immerman 1982]
Neil Immerman: Relational Queries Computable in Polynomial Time (Extended Abstract). STOC 1982: 147-152 BibTeX
[Ioannidis 1986a]
...
[Ioannidis 1986b]
Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411 BibTeX
[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 BibTeX
[Ioannidis and Ramakrishnan 1988]
Yannis E. Ioannidis, Raghu Ramakrishnan: Efficient Transitive Closure Algorithms. VLDB 1988: 382-394 BibTeX
[Ioannidis and Wong 1987a]
Yannis E. Ioannidis, Eugene Wong: Query Optimization by Simulated Annealing. SIGMOD Conference 1987: 9-22 BibTeX
[Ioannidis and Wong 1987b]
Yannis E. Ioannidis, Eugene Wong: An Algebraic Approach to Recursive Inference. Expert Database Conf. 1986: 295-309 BibTeX
[Ioannidis and Wong 1988]
Yannis E. Ioannidis, Eugene Wong: Transforming Nonlinear Recursion into Linear Recursion. Expert Database Conf. 1988: 401-421 BibTeX
[Jaeschke and Scheck 1982]
Gerhard Jaeschke, Hans-Jörg Schek: Remarks on the Algebra of Non First Normal Form Relations. PODS 1982: 124-138 BibTeX
[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 BibTeX
[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 BibTeX
[Jarke and Koch 1984]
Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984) BibTeX
[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) BibTeX
[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) BibTeX
[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) BibTeX
[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 BibTeX
[Kanellakis and Papadimitriou 1981]
Paris C. Kanellakis, Christos H. Papadimitriou: The Complexity of Distributed Concurrency Control. FOCS 1981: 185-197 BibTeX
[Kanellakis and Papadimitriou 1984]
Paris C. Kanellakis, Christos H. Papadimitriou: Is Distributed Locking Harder? J. Comput. Syst. Sci. 28(1): 103-120(1984) BibTeX
[Kedem and Silberschatz 1979]
Zvi M. Kedem, Abraham Silberschatz: Controlling Concurrency Using Locking Protocols (Preliminary Report). FOCS 1979: 274-285 BibTeX
[Kedem and Silberschatz 1980]
Zvi M. Kedem, Abraham Silberschatz: Non-Two-Phase Locking Protocols with Shared and Exclusive Locks. VLDB 1980: 309-317 BibTeX
[Keller 1985]
Arthur M. Keller: Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins. PODS 1985: 154-163 BibTeX
[Kellogg et al. 1986]
Charles Kellogg, Anthony B. O'Hare, Larry Travis: Optimizing the Rule-Data Interface in a KMS. VLDB 1986: 42-51 BibTeX
[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 BibTeX
[Kent 1979]
William Kent: Limitations of Record-Based Information Models. ACM Trans. Database Syst. 4(1): 107-131(1979) BibTeX
[Kent 1981]
William Kent: Consequences of Assuming a Universal Relation. ACM Trans. Database Syst. 6(4): 539-556(1981) BibTeX
[Kent 1983]
William Kent: The Universal Relation Revisited. ACM Trans. Database Syst. 8(4): 644-648(1983) BibTeX
[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 BibTeX
[Kerschberg et al. 1977]
Larry Kerschberg, Anthony C. Klug, Dennis Tsichritzis: A Taxonomy of Data Models. VLDB 1976: 43-64 BibTeX
[Khoshafian and Copeland 1986]
Setrag Khoshafian, George P. Copeland: Object Identity. OOPSLA 1986: 406-416 BibTeX
[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 BibTeX
[Kim 1979]
Won Kim: Relational Database Systems. ACM Comput. Surv. 11(3): 187-211(1979) BibTeX
[Kim 1981]