Fine hierarchies of generic computation

  • Jerzy Tyszkiewicz
Contributed Papers Session 2: Logic and Databases I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)


Suppose that you are a user of a commercial relational database, accessible over the Internet, whose owner has decided to copy the price lists of the US telephone companies — first order queries are for free just like local calls, because they are local by the theorem of Gaifman

These are the rules. Well, what is your strategy, to compute all you want to know about the database, paying as little as possible? And how much will the total price be?

We answer this question, showing that the question whether you can get your answer without any costs at all, depends on whether or not the theories of databases in the provided query language are finitely axiomatizable.

Thus, assuming there is a limit on the number of variables allowed in queries, if the database query language is the fixpoint logic, you can get everything for free. When it is Datalog however, even with inequality and negation of the edb's, you have to pay. We present a method, which for graphs of n vertices costs about $ log2 log2n. Thus querying a graph with 1 Terabyte vertices costs $7.00. We demonstrate that this price cannot be substantially reduced without causing a large computational overhead.


Query Language Indistinguishability Relation Input Structure Finite Model Boolean Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Abiteboul, J. Hull and V. Vianu, Foundations of Databases, Addison-Wesley, 1995.Google Scholar
  2. 2.
    S. Abiteboul, C. Papadimitriou and V. Vianu, The power of reflective relational machines, in: Proc. 9th Symposium on Logic in Computer Science, 1994, pp. 230–240.Google Scholar
  3. 3.
    S. Abiteboul and V. Vianu, Generic computation and its complexity, in: Proc. ACM SIGACT Symp. on the Theory of Computing, 1991, pp. 209–219.Google Scholar
  4. 4.
    A. Dawar, S. Lindell and S. Weinstein, Infinitary logic and inductive definability over finite structures, Information and Computation, 119, 1995.Google Scholar
  5. 5.
    H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer Verlag, 1995.Google Scholar
  6. 6.
    H. Gaifman, On local and nonlocal properties, in: J. Stern (ed.), Logic Colloquium '81, North Holland, 1982, pp. 105–135.Google Scholar
  7. 7.
    Ph. Kolaitis and M. Vardi, On the expressive power of Datalog: tools and a case study, in: Proceedings of the 9th Symposium on Principles of Database Systems, 1990, pp. 46–57.Google Scholar
  8. 8.
    E. Rosen and S. Weinstein, Preservation theorems in finite model theory, in: D. Leivant (ed.), Logic and Complexity, Springer Verlag, 1995.Google Scholar
  9. 9.
    J. Tyszkiewicz, On the Kolmogorov expressive power of Boolean query languages, to appear in Theoretical Computer Science. Preliminary version appeared in: G. Gottlob, M.Y. Vardi (eds.), Proc. ICDT'95, Lecture Notes in Computer Science 893, Springer Verlag, pp. 97–110Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jerzy Tyszkiewicz
    • 1
  1. 1.Mathematische Grundlagen der InformatikRWTH AachenAachenGermany

Personalised recommendations