Database Interrogation Using Conjunctive Queries
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.
KeywordsBinary Relation Database Server Simple Cycle Conjunctive Query Relational Machine
Unable to display preview. Download preview PDF.
- 1.S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.Google Scholar
- 4.M. Davis. Computability and Unsolvability. McGraw-Hill, 1958.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
- 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