Perspectives on database theory

Database management systems address the need to store, retrieve, and manipulate large amounts o f data in an organized fashion. The database field has grown tremendously in the last 25 years. It is reported that the database industry generated $7 billion in revenue in 1994 and is growing at a rate o f 35% per year [Gr2]. Industrial and academic research have been instrumental to this growth. Theory has played an important role in defining the right abstractions and concepts, and providing a firm foundation for the field.

[1]  Mihalis Yannakakis,et al.  Tie-breaking semantics and structural totality , 1992, PODS '92.

[2]  Jennifer Widom,et al.  Active Database Systems: Triggers and Rules For Advanced Database Processing , 1994 .

[3]  Mihalis Yannakakis,et al.  The input/output complexity of transitive closure , 1990, SIGMOD '90.

[4]  Peter Honeyman,et al.  Testing satisfaction of functional dependencies , 1982, JACM.

[5]  Joe R. Hill.  Relational Databases: A Tutorial for Statisticians , 1991 .

[6]  Harry B. Hunt,et al.  Operations on sparse relations , 1977, CACM.

[7]  J. Lingoes.  The Multivariate Analysis Of Qualitative Data , 1968 .

[8]  Mihalis Yannakakis,et al.  Algebraic dependencies , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[9]  Y. C. Tay,et al.  Locking performance in centralized databases , 1985, TODS.

[10]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[12]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[13]  Ronald Fagin,et al.  Inclusion Dependencies and Their Interaction with Functional Dependencies , 1984, J. Comput. Syst. Sci..

[14]  Phokion G. Kolaitis,et al.  On the Expressive Power of Datalog: Tools and a Case Study , 1995, J. Comput. Syst. Sci..

[15]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[16]  Jeffrey D. Ullman,et al.  Bottom-up beats top-down for datalog , 1989, PODS '89.

[17]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[18]  Clement T. Yu,et al.  An algorithm for tree-query membership of a distributed query , 1979, COMPSAC.

[19]  Ron van der Meyden.  The Complexity of Querying Indefinite Data about Linearly Ordered Domains , 1997, J. Comput. Syst. Sci..

[20]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[21]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[22]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[23]  Rakesh Agrawal.  Tutorial database mining , 1994, PODS '94.

[24]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[25]  Catriel Beeri,et al.  New data models and languages—the challenge , 1992, PODS.

[26]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

[27]  Philip A. Bernstein,et al.  Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[28]  Dan Geiger,et al.  Axioms and Algorithms for Inferences Involving Probabilistic Independence , 1991, Inf. Comput..

[29]  Surajit Chaudhuri,et al.  Optimization of real conjunctive queries , 1993, PODS '93.

[30]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[31]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[32]  Vassos Hadzilacos,et al.  A theory of reliability in database systems , 1988, JACM.

[33]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[34]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[35]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[36]  Mihalis Yannakakis,et al.  Independent Database Schemas , 1984, J. Comput. Syst. Sci..

[37]  Abraham Silberschatz,et al.  View maintenance issues for the chronicle data model (extended abstract) , 1995, PODS.

[38]  Rajeev Motwani,et al.  Scheduling problems in parallel query optimization , 1995, PODS '95.

[39]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[40]  Gerhard Weikum,et al.  Tutorial on Parallel Database Systems , 1995, ICDT.

[41]  Mihalis Yannakakis,et al.  Equivalence among Relational Expressions with the Union and Difference Operation , 1978, VLDB.

[42]  Lawrence J. Henschen,et al.  On compiling queries in recursive first-order databases , 1984, JACM.

[43]  Abraham Silberschatz,et al.  Consistency in Hierarchical Database Systems , 1980, JACM.

[44]  Allen Van Gelder,et al.  The well-founded semantics of aggregation , 1992, PODS.

[45]  Heikki Mannila,et al.  Design of Relational Databases , 1992 .

[46]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[47]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[48]  Shinichi Morishita,et al.  Design and implementation of the glue-nail database system , 1993, SIGMOD Conference.

[49]  Serge Abiteboul,et al.  Querying and Updating the File , 1993, VLDB.

[50]  Tomasz Imielinski,et al.  The Relational Model of Data and Cylindric Algebras , 1984, J. Comput. Syst. Sci..

[51]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[52]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[53]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[54]  Michael Stonebraker,et al.  Database systems: achievements and opportunities , 1990, SGMD.

[55]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.

[56]  Paris C. Kanellakis,et al.  Constraint programming and database languages: a tutorial , 1995, PODS '95.

[57]  Mihalis Yannakakis,et al.  Serializability by Locking , 1984, JACM.

[58]  Letizia Tanca,et al.  Logic Programming and Databases , 1990, Surveys in Computer Science.

[59]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[60]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[61]  Suzanne W. Dietrich,et al.  Extension Tables: Memo Relations in Logic Programming , 1987, SLP.

[62]  Richard Hull,et al.  A Survey of Theoretical Research on Typed Complex Database Objects , 1988, XP7.52 Workshop on Database Theory.

[63]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[64]  Christos H. Papadimitriou,et al.  On concurrency control by multiple versions , 1982 .

[65]  Sushil Jajodia,et al.  Temporal Databases: Theory, Design, and Implementation , 1993 .

[66]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[67]  S. Rozen,et al.  Database-and Workflow-Management Challenges Posed by the Human Genome Project , 1995 .

[68]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[69]  Foto N. Afrati,et al.  Expressiveness of restricted recursive queries , 1989, STOC '89.

[70]  Mihalis Yannakakis,et al.  A Theory of Safe Locking Policies in Database Systems , 1982, JACM.

[71]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[72]  Jeffrey D. Ullman,et al.  Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization , 1982, JACM.

[73]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[74]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[75]  Divesh Srivastava,et al.  Implementation of the CORAL deductive database system , 1993, SIGMOD Conference.

[76]  Neil Immerman,et al.  Dyn-FO: A Parallel, Dynamic Complexity Class , 1997, J. Comput. Syst. Sci..

[77]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[78]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[79]  Jeffrey D. Ullman.  The role of theory today , 1995, CSUR.

[80]  Alberto O. Mendelzon.  Database states and their tableaux , 1984, TODS.

[81]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[82]  Serge Abiteboul,et al.  Database theory column , 1989, SIGA.

[83]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[84]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[85]  Edward P. F. Chan.  Containment and minimization of positive conjunctive queries in OODB's , 1992, PODS.

[86]  Gabriel M. Kuper,et al.  The logical data model , 1993, TODS.

[87]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

[88]  Mihalis Yannakakis,et al.  Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..

[89]  Daniel J. Rosenkrantz,et al.  Concurrency control for database systems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[90]  Ronald Fagin,et al.  A simplied universal relation assumption and its properties , 1982, TODS.

[91]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[92]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[93]  Raghu Ramakrishnan,et al.  Transitive closure algorithms based on graph traversal , 1993, TODS.

[94]  Moshe Y. Vardi.  Invited talk: automata theory for database theoreticians , 1989, PODS '89.

[95]  Robert A. Di Paola.  The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas , 1969, JACM.

[96]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[97]  Matthias Jarke,et al.  Query Optimization in Database Systems , 1984, CSUR.

[98]  Jim Gray,et al.  A critique of ANSI SQL isolation levels , 1995, SIGMOD '95.

[99]  N. N. Vorob’ev.  Consistent Families of Measures and Their Extensions , 1962 .

[100]  Catriel Beeri,et al.  A model for concurrency in nested transactions systems , 1989, JACM.

[101]  Eugene Wong,et al.  Query optimization by simulated annealing , 1987, SIGMOD '87.

[102]  Butler W. Lampson,et al.  Atomic Transactions , 1980, Advanced Course: Distributed Systems.

[103]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[104]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[105]  Johann A. Makowsky,et al.  Embedded implicational dependencies and their inference problem , 1981, STOC '81.

[106]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[107]  Jeffrey D. Ullman,et al.  A survey of deductive database systems , 1995, J. Log. Program..

[108]  Edith Cohen,et al.  Estimating the size of the transitive closure in linear time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[109]  Zvi Galil,et al.  An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[110]  Mihalis Yannakakis,et al.  On Datalog vs. polynomial time (extended abstract) , 1991, PODS '91.

[111]  R. Bayer,et al.  Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[112]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[113]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[114]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[115]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

[116]  Jianwen Su,et al.  Algebraic and Calculus Query Languages for Recursively Typed Complex Objects , 1993, J. Comput. Syst. Sci..

[117]  Per-Åke Larson,et al.  Updating derived relations: detecting irrelevant and autonomously computable updates , 1986, VLDB.

[118]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[119]  Dan Suciu,et al.  Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure , 1994, PODS '94.

[120]  Maurice Herlihy,et al.  Hybrid Concurrency Control for Abstract Data Types , 1991, J. Comput. Syst. Sci..

[121]  Shamkant B. Navathe,et al.  Conceptual Database Design: An Entity-Relationship Approach , 1991 .

[122]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

[123]  T. Speed,et al.  Markov Fields and Log-Linear Interaction Models for Contingency Tables , 1980 .

[124]  Foto N. Afrati,et al.  Bonded arity Datalog (≠) queries on graphs , 1994, PODS '94.

[125]  Yuri Gurevich,et al.  Datalog vs First-Order Logic , 1994, J. Comput. Syst. Sci..

[126]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[127]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[128]  Christos H. Papadimitriou,et al.  The Theory of Database Concurrency Control , 1986 .

[129]  David Maier,et al.  On the foundations of the universal relation model , 1984, TODS.

[130]  Christian Herrmann.  On the Undecidability of Implications Between Embedded Multivalued Database Dependencies , 1995, Inf. Comput..

[131]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[132]  Hans-Jörg Schek,et al.  Towards a unified theory of concurrency control and recovery , 1993, PODS.

[133]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[134]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[135]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

[136]  Dale Skeen,et al.  Nonblocking commit protocols , 1981, SIGMOD '81.

[137]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[138]  Phokion G. Kolaitis,et al.  Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..

[139]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[140]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[141]  Alfred V. Aho,et al.  The theory of joins in relational data bases , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[142]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[143]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[144]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[145]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[146]  Raghu Ramakrishnan.  Applications of Logic Databases , 1995, The Kluwer International Series in Engineering and Computer Science 296.

[147]  Hamid Pirahesh,et al.  Magic is relevant , 1990, SIGMOD '90.

[148]  François Bancilhon,et al.  Building an Object-Oriented Database System, The Story of O2 , 1992 .

[149]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

[150]  Marc Gyssens,et al.  The Structure of the Relational Database Model , 1989, EATCS Monographs on Theoretical Computer Science.

[151]  Randy H. Katz,et al.  Toward a unified framework for version modeling in engineering databases , 1990, CSUR.

[152]  Nancy A. Lynch,et al.  A Theory of Atomic Transactions , 1988, ICDT.

[153]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[154]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[155]  Pierre America,et al.  Parallel Database Systems , 1991 .

[156]  Monika Henzinger,et al.  Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.

[157]  Paris C. Kanellakis,et al.  Logic Programming and Parallel Complexity , 1986, Foundations of Deductive Databases and Logic Programming..

[158]  Christos H. Papadimitriou,et al.  The parallel complexity of simple logic programs , 1993, JACM.

[159]  Mihalis Yannakakis,et al.  The complexity of reliable concurrency control , 1985, PODS '85.

[160]  Vinay K. Chaudhri,et al.  Safe locking policies for dynamic databases , 1995, PODS '95.

[161]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[162]  Christos Faloutsos,et al.  Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.

[163]  Bruno Courcelle,et al.  Recursive Queries and Context-free Graph Grammars , 1991, Theor. Comput. Sci..

[164]  Jeffrey F. Naughton,et al.  Query Size Estimation by Adaptive Sampling , 1995, J. Comput. Syst. Sci..

[165]  Ronald Fagin,et al.  The theory of data dependencies - a survey , 1984 .

[166]  Heikki Mannila,et al.  The power of sampling in knowledge discovery , 1994, PODS '94.

[167]  Kenneth A. Ross,et al.  Monotonic aggregation in deductive databases , 1992, J. Comput. Syst. Sci..

[168]  Phokion G. Kolaitis.  Combinatorial games in database theory , 1995, PODS '95.

[169]  Phokion G. Kolaitis.  Languages for Polynomial-Time Queries - An Ongoing Quest , 1995, ICDT.

[170]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[171]  Ashok K. Chandra.  Theory of database queries , 1988, PODS '88.

[172]  Paris C. Kanellakis,et al.  Database Theory Column: Query Languages for Complex Object Databases. , 1990 .

[173]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

[174]  Yehoshua Sagiv,et al.  A characterization of globally consistent databases and their correct access paths , 1983, TODS.

[175]  Anthony C. Klug.  Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions , 1982, JACM.

[176]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[177]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[178]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[179]  Jan Paredaens,et al.  Spatial Databases, The Final Frontier , 1995, ICDT.

[180]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[181]  Nicole Bidoit,et al.  Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..

[182]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[183]  Val Tannen.  Tutorial: languages for collection types , 1994, PODS '94.

[184]  Mihalis Yannakakis.  Querying weak instances , 1984, PODS '84.

[185]  L. A. Goodman.  The Multivariate Analysis of Qualitative Data: Interactions among Multiple Classifications , 1970 .

[186]  Jeffrey F. Naughton,et al.  On the relative cost of sampling for join selectivity estimation , 1994, PODS '94.

[187]  Nathan Goodman,et al.  Tree queries: a simple class of relational queries , 1982, TODS.

[188]  Carlo Zaniolo,et al.  Analysis and design of relational schemata for database systems. , 1976 .

[189]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[190]  Serge Abiteboul,et al.  Database theory column , 1989, SIGA.

[191]  Arun N. Swami,et al.  Optimization of large join queries: combining heuristics and combinatorial techniques , 1989, SIGMOD '89.

[192]  Hector Garcia-Molina,et al.  Altruistic locking , 1994, TODS.

[193]  Alberto O. Mendelzon,et al.  Hy+: a Hygraph-based query and visualization system , 1993, SIGMOD '93.

[194]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[195]  Carlo Zaniolo,et al.  The LDL System Prototype , 1990, IEEE Trans. Knowl. Data Eng..

[196]  Christos H. Papadimitriou.  Database metatheory: asking the big queries , 1995 .

[197]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[198]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[199]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .