Talks and Poster Presentations (with Proceedings-Entry):
R. Pichler, S. Skritek:
"Tractable Counting of the Answers to Conjunctive Queries";
Talk: AMW - Alberto Mendelzon International Workshop on Foundations of Data Management,
- 2011-05-12; in: "CEUR Workshop Proceedings",
P. Barceló, V. Tannen (ed.);
CEUR Workshop Proceedings,
Paper ID 4,
Conjunctive queries (CQs) are one of the most fundamental forms of database queries. In general, the evaluation of CQs is NP-complete. Consequently, there has been an intensive search for tractable
fragments. In this paper, we want to initiate a systematic search for
tractable fragments of the counting problem of CQs, i.e., the problem
of counting the answers to a CQ. We prove several new tractability and
intractability results by starting with acyclic conjunctive queries and generalising these results to CQs of bounded hypertree-width.
Project Head Reinhard Pichler:
Created from the Publication Database of the Vienna University of Technology.