Database theory: query languages

This chapter gives an introduction to the theoretical foundations of query languages for relational databases. It thus addresses a significant part of database theory. Special emphasis is put on the expressive power of query languages and the computational complexity of their associated evaluation and static analysis problems.

[1]  Christos H. Papadimitriou,et al.  The complexity of knowledge representation , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[2]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[3]  Martin Grohe,et al.  The Quest for a Logic Capturing PTIME , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

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

[5]  Johann A. Makowsky,et al.  Query Languages for Hierarchic Databases , 1992, Inf. Comput..

[6]  Arnaud Durand,et al.  On Acyclic Conjunctive Queries and Constant Delay Enumeration , 2007, CSL.

[7]  Nicole Schweikardt,et al.  Comparing the succinctness of monadic query languages over finite trees , 2004, RAIRO Theor. Informatics Appl..

[8]  Jan Van den Bussche,et al.  Constraint databases: a tutorial introduction , 2000, SGMD.

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

[10]  Jan Van den Bussche,et al.  Repetitions and permutations of columns in the semijoin algebra , 2009, RAIRO Theor. Informatics Appl..

[11]  Martin Grohe.  Generalized Model-Checking Problems for First-Order Logic , 2001, STACS.

[12]  Martin Grohe,et al.  Logic, graphs, and algorithms , 2007, Logic and Automata.

[13]  Guillaume Bagan,et al.  MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay , 2006, CSL.

[14]  Francesco Scarcello,et al.  Query answering exploiting structural properties , 2005, SGMD.

[15]  Jan Van den Bussche,et al.  On the completeness of object-creating database transformation languages , 1997, JACM.

[16]  Bart Selman,et al.  The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.

[17]  Leonid Libkin,et al.  Expressive power of SQL , 2001, Theor. Comput. Sci..

[18]  Georg Gottlob,et al.  Datalog LITE: a deductive query language with linear time model checking , 2002, TOCL.

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

[20]  Jeffrey B. Remmel,et al.  PTIME Queries Revisited , 2005, ICDT.

[21]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[22]  Martin Grohe,et al.  Finite Variable Logics in Descriptive Complexity Theory , 1998, Bulletin of Symbolic Logic.

[23]  Martin Grohe,et al.  Fixed-point logics on planar graphs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[24]  Richard Hull,et al.  Relative information capacity of simple relational database schemata , 1984, SIAM J. Comput..

[25]  Phokion G. Kolaitis,et al.  On the complexity of the containment problem for conjunctive queries with built-in predicates , 1998, PODS '98.

[26]  Sophie Cluet,et al.  Designing OQL: Allowing Objects to be Queried , 1998, Inf. Syst..

[27]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

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

[29]  Jörg Flum,et al.  Query evaluation via tree-decompositions , 2001, JACM.

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

[31]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[32]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[33]  Andreas Blass,et al.  A Zero-One Law for Logic with a Fixed-Point Operator , 1986, Inf. Control..

[34]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 2000, Theor. Comput. Sci..

[35]  Nicolás Marín,et al.  Review of Data on the Web: from relational to semistructured data and XML by Serge Abiteboul, Peter Buneman, and Dan Suciu. Morgan Kaufmann 1999. , 2003, SGMD.

[36]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 2001, JACM.

[37]  Jan Van den Bussche,et al.  On the complexity of division and set joins in the relational algebra , 2007, J. Comput. Syst. Sci..

[38]  Limsoon Wong,et al.  Principles of Programming with Complex Objects and Collection Types , 1995, Theor. Comput. Sci..

[39]  Bruno Courcelle,et al.  Linear delay enumeration and monadic second-order logic , 2009, Discret. Appl. Math..

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

[41]  Anuj Dawar,et al.  The Power of Counting Logics on Restricted Classes of Finite Structures , 2007, CSL.

[42]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[43]  Nicole Schweikardt,et al.  Machine models and lower bounds for query processing , 2007, PODS '07.

[44]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.

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

[46]  Yu. V. Glebskii,et al.  Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[47]  Werner Nutt,et al.  Deciding equivalences among conjunctive aggregate queries , 2007, JACM.

[48]  Phokion G. Kolaitis,et al.  The containment problem for Real conjunctive queries with inequalities , 2006, PODS '06.

[49]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[50]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[51]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[52]  Martin Grohe,et al.  The parameterized complexity of database queries , 2001, PODS '01.

[53]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

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

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

[56]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[57]  Dirk Van Gucht,et al.  Possibilities and limitations of using flat operators in nested algebra expressions , 1988, PODS '88.

[58]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

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

[60]  Leonid Libkin,et al.  Logics for Unranked Trees: An Overview , 2005, Log. Methods Comput. Sci..

[61]  Leonid Libkin,et al.  Logics with counting and local properties , 2000, TOCL.

[62]  A S Kahr,et al.  ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

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

[64]  Surajit Chaudhuri,et al.  On the Equivalence of Recursive and Nonrecursive Datalog Programs , 1997, J. Comput. Syst. Sci..

[65]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[66]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

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

[68]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[69]  Lauri Hella,et al.  Notions of Locality and Their Logical Characterizations over Finite Models , 1999, J. Symb. Log..

[70]  Michael Stonebraker,et al.  The 8 requirements of real-time stream processing , 2005, SGMD.

[71]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[72]  Nicole Schweikardt,et al.  Arithmetic, first-order logic, and counting quantifiers , 2002, TOCL.

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

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

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

[76]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

[77]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

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

[79]  Michael Kifer,et al.  Logical foundations of object-oriented and frame-based languages , 1995, JACM.

[80]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[81]  Arnaud Durand,et al.  First-order queries on structures of bounded degree are computable with constant delay , 2005, TOCL.

[82]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[83]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[84]  Neil Immerman,et al.  Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[85]  Limsoon Wong,et al.  Normal Forms and Conservative Extension Properties for Query Languages over Collection Types , 1996, J. Comput. Syst. Sci..

[86]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

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

[88]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[89]  R. G. G. Cattell,et al.  The Object Database Standard: ODMG-93 , 1993 .

[90]  Y. Gurevich,et al.  Remarks on Berger's paper on the domino problem , 1972 .

[91]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[92]  Jan Van den Bussche,et al.  The Semijoin Algebra and the Guarded Fragment , 2004, J. Log. Lang. Inf..

[93]  Catriel Beeri,et al.  The power of languages for the manipulation of complex values , 1995, The VLDB Journal.

[94]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

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

[96]  Martin Grohe,et al.  Definability and Descriptive Complexity on Databases of Bounded Tree-Width , 1999, ICDT.

[97]  Raghu Ramakrishnan,et al.  Containment of conjunctive queries: beyond relations as sets , 1995, TODS.

[98]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[99]  Michael R. Fellows,et al.  The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1] , 1996, DMTCS.