ABSTRACT
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By now, finite model theory has built a large arsenal of tools that can easily be used by database theoreticians without going to the basics such as combinatorial games. We survey such tools here, focusing not on how they are proved, but rather on how to apply them, as-is, in various questions that come up in database theory.
- M. Ajtai. Sigma11 formulae on finite structures. Annals of Pure and Applied Logic, 24 (1983), 1--48.Google Scholar
Cross Ref
- A. Blass, Y. Gurevich, and D. Kozen. A zero-one law for logic with a fixed-point operator. Information and Control, 67 (1985), 70--90. Google Scholar
Digital Library
- M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS'06, pages 10--19. Google Scholar
Digital Library
- A. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21 (1980), 156--178.Google Scholar
Cross Ref
- A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119 (1995), 160--175. Google Scholar
Digital Library
- G. Dong, L. Libkin, and L. Wong. Local properties of query languages. Theoretical Computer Science, 239 (2000), 277--308. Google Scholar
Digital Library
- H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.Google Scholar
- R. Fagin. Monadic generalized spectra. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 21 (1975), 89--96.Google Scholar
- R. Fagin. Probabilities on finite models. Journal of Symbolic Logic, 41 (1976), 50--58.Google Scholar
- R. Fagin, L. Stockmeyer, and M.Y. Vardi. On monadic NP vs monadic co-NP. Information and Computation, 120 (1994), 78--92. Google Scholar
Digital Library
- M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. In IEEE Symp. on Logic in Computer Science, 2002, pages 215--224. Google Scholar
Digital Library
- H. Gaifman. On local and non-local properties, Proc.Herbrand Symp., Logic Colloquium '81. North-Holland, 1982.Google Scholar
Cross Ref
- G. Gottlob and C. Koch. Monadic datalog and the expressive power of languages for Web information extraction. Journal of the ACM, 51 (2004), 74--113. Google Scholar
Digital Library
- E. Graedel, Ph. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema, S. Weinstein. Finite Model Theory and its Applications. Springer-Verlag, 2004. Google Scholar
Digital Library
- M. Grohe. Parameterized complexity for the database theorist. SIGMOD Record, 31 (2002), 86--96. Google Scholar
Digital Library
- M. Grohe. Logic, graphs, and algorithms. In Logic and Automata -- History and Perspectives, Amsterdam Univ. Press, 2007.Google Scholar
- M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. ACM Transactions on Computational Logic, 1 (2000), 112--130. Google Scholar
Digital Library
- S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173 (1997), 151--181. Google Scholar
Digital Library
- Y. Gurevich. Logic and the challenge of computer science. In Current trends in theoretical computer science, E. Borger, ed., Computer Science Press, 1988, pages 1--57.Google Scholar
- W. Hanf. Model-theoretic methods in the study of elementary logic. In The Theory of Models, North-Holland, 1965, pages 132--145.Google Scholar
- L. Hella, L. Libkin, and J. Nurmonen. Notions of locality and their logical characterizations over finite models. Journal of Symbolic Logic, 64 (1999), 1751--1773.Google Scholar
Cross Ref
- L. Hella, L. Libkin, J. Nurmonen, and L. Wong. Logics with aggregate operators. Journal of the ACM, 48 (2001), 880--907. Google Scholar
Digital Library
- N. Immerman. Relational queries computable in polynomial time. Information and Control, 68 (1986), 86--104. Google Scholar
Digital Library
- N. Immerman. Descriptive Complexity. Springer, 1998.Google Scholar
- N. Immerman and E. Lander. Describing graphs: a first order approach to graph canonization. In Complexity Theory Retrospective, Springer-Verlag, Berlin, 1990.Google Scholar
- G. Kuper, L. Libkin, and J. Paredaens, eds. Constraint Databases. Springer, 2000. Google Scholar
Digital Library
- L. Libkin. On counting logics and local properties. ACM Transactions on Computational Logic, 1 (2000), 33--59. Google Scholar
Digital Library
- L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google Scholar
Digital Library
- L. Libkin. Logics over unranked trees: an overview. LMCS 2(3): (2006).Google Scholar
- J. Lynch. Almost sure theories. Annals of Mathematical Logic, 18 (1980), 91--135.Google Scholar
Cross Ref
- J. Makowsky. Algorithmic aspects of the Feferman-Vaught Theorem. Annals of Pure and Applied Logic, 126 (2004), 159--213.Google Scholar
Cross Ref
- H. Niemisto. Locality and order-invariant logics. PhD Thesis, Univ.of Helsinki, 2007.Google Scholar
- F. Neven, Th. Schwentick. Query automata over finite trees. TCS 275 (2002), 633--674. Google Scholar
Digital Library
- J. Nurmonen. On winning strategies with unary quantifiers. Journal of Logic and Computation, 6 (1996), 779--798.Google Scholar
Cross Ref
- M. Otto. Two variable first-order logic over ordered domains. J. Symb. Logic 66 (2001), 685--702.Google Scholar
Cross Ref
- C. Papadimitriou. A note on the expressive power of Prolog. Bulletin of the EATCS, 26 (1985), 21--23.Google Scholar
- J. Rosenstein. Linear Orderings. Academic Press, 1982.Google Scholar
- B. Rossman. On the constant-depth complexity of k-clique. In STOC'08, pages 721--730. Google Scholar
Digital Library
- T. Schwentick. Automata for XML -- a survey. JCSS 73 (2007), 289--315. Google Scholar
Digital Library
- D. Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6 (1996), 505--526.Google Scholar
- B.A. Trakhtenbrot. The impossibilty of an algorithm for the decision problem for finite models. Doklady Academii Nauk SSSR, 70 (1950), 569--572.Google Scholar
- M.Y. Vardi. The complexity of relational query languages. In Proc.ACM Symp.on Theory of Computing, 1982, 137--146. Google Scholar
Digital Library
- M.Y. Vardi. On the complexity of bounded-variable queries. In ACM Symp. on Principles of Database Systems, ACM Press, 1995, pages 266--276. Google Scholar
Digital Library
- V. Vianu. Databases and finite-model theory. In Descriptive Complexity and Finite Models, Proc. of a DIMACS workshop. AMS, 1997, pages 97--148.Google Scholar
Index Terms
The finite model theory toolbox of a database theoretician
Recommendations
Incorporating NoSQL into a database course
This article introduces the concepts of Big Data and NoSQL and describes a semester long web-based project that uses both a relational database (Oracle 11g) and a NoSQL (MongoDB) database for an undergraduate database course. The relational database ...
Complexity and expressive power of logic programming
This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention ...
User-database interface: the effect of abstraction levels on query performance*
A common classification of data models is based on their abstraction levels: physical, logical and conceptual. The user-database interaction can be similarly classified. For the conceptual-level interaction, the user and the database exchange ...






Comments