Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Queries and algorithms computable by polynomial time existential reflective machines
Fundamenta Informaticae
Reflective relational machines
Information and Computation
Secure databases: protection against user influence
ACM Transactions on Database Systems (TODS)
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reflective Relational Machines Working on Homogeneous Databases
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Computability by Sequences of Queries
Fundamenta Informaticae
Privacy in GLAV information integration
ICDT'07 Proceedings of the 11th international conference on Database Theory
Privacy in database publishing
ICDT'05 Proceedings of the 10th international conference on Database Theory
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.