Database Interrogation Using Conjunctive Queries

  • Michał Bielecki
  • Jan Van den Bussche
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2572)


We consider a scenario where a client communicates with a database server by posing boolean conjunctive queries, or more generally, counts of conjunctive queries. We investigate to what extent features such as quantification, negation, or non-equalities are important in such a setting. We also investigate the difference between a setting where the client can pose an adaptive sequence of queries, and a setting where the client must pose a fixed combination of queries.


Binary Relation Database Server Simple Cycle Conjunctive Query Relational Machine 
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, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.Google Scholar
  2. 2.
    S. Abiteboul, C.H. Papadimitriou, and V. Vianu. Reflective relational machines. Information and Computation, 143(2):110–136, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    N.R. Adam and J.C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4):515–556, 1989.CrossRefGoogle Scholar
  4. 4.
    M. Davis. Computability and Unsolvability. McGraw-Hill, 1958.Google Scholar
  5. 5.
    D. Dobkin, A.K. Jones, and R.J. Lipton. Secure databases: Protection against user influence. ACM Transactions on Database Systems, 4(1):97–106, 1979.CrossRefGoogle Scholar
  6. 6.
    H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, second edition, 1999.Google Scholar
  7. 7.
    J.M. Turull Torres. Reflective relational machines working on homogeneous databases. In Foundations of Information and Knowledge Systems, volume 1762 of Lecture Notes in Computer Science, pages 288–303. Springer, 2000.Google Scholar
  8. 8.
    J. Tyszkiewicz. Queries and algorithms computable by polynomial time existential reflective machines. Fundamenta Informaticae, 32:91–105, 1997.MathSciNetGoogle Scholar
  9. 9.
    J. Tyszkiewicz. Computability by sequences of queries. Fundamenta Informaticae, 48:389–414, 2001.MathSciNetGoogle Scholar
  10. 10.
    J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, 1988.Google Scholar
  11. 11.
    J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1989.Google Scholar
  12. 12.
    J.D. Ullman. Information integration using logical views. Theoretical Computer Science, 239(2):189–210, 2000.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Michał Bielecki
    • 1
  • Jan Van den Bussche
    • 2
  1. 1.Warsaw UniversityPoland
  2. 2.University of LimburgBelgium

Personalised recommendations