Skip to main content
SpringerLink
Log in

Database Interrogation Using Conjunctive Queries

  • Conference paper
  • First Online:
Database Theory — ICDT 2003 (ICDT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2572))

Included in the following conference series:

Abstract

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.

Research supported by Polish KBN grant 7T11C 007 21.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. S. Abiteboul, C.H. Papadimitriou, and V. Vianu. Reflective relational machines. Information and Computation, 143(2):110–136, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  4. M. Davis. Computability and Unsolvability. McGraw-Hill, 1958.

    Google Scholar 

  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.

    Article  Google Scholar 

  6. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, second edition, 1999.

    Google Scholar 

  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. J. Tyszkiewicz. Queries and algorithms computable by polynomial time existential reflective machines. Fundamenta Informaticae, 32:91–105, 1997.

    MathSciNet  Google Scholar 

  9. J. Tyszkiewicz. Computability by sequences of queries. Fundamenta Informaticae, 48:389–414, 2001.

    MathSciNet  Google Scholar 

  10. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, 1988.

    Google Scholar 

  11. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1989.

    Google Scholar 

  12. J.D. Ullman. Information integration using logical views. Theoretical Computer Science, 239(2):189–210, 2000.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University, Poland

    Michał Bielecki

  2. University of Limburg, Belgium

    Jan Van den Bussche

Authors
  1. Michał Bielecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00198, Roma, Italy

    Diego Calvanese  & Maurizio Lenzerini  & 

  2. Department of Computer Science, Stanford University, Room 474 Gates Computer Science Building 4B, 94305-9045, Stanford, CA, USA

    Rajeev Motwani

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bielecki, M., Van den Bussche, J. (2003). Database Interrogation Using Conjunctive Queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds) Database Theory — ICDT 2003. ICDT 2003. Lecture Notes in Computer Science, vol 2572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36285-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-36285-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00323-6

  • Online ISBN: 978-3-540-36285-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation