Abstract / Description of output
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem is highly relevant to query optimization, information integration, and ontological reasoning. We present a rewriting algorithm, inspired by resolution in Logic Programming, which is capable of dealing with an expressive class of TGDs, called sticky TGDs. Given a set of sticky TGDs and a conjunctive query, the algorithm produces a first-order query that can be then evaluated over the data, providing the correct answers. In this way, we establish that conjunctive query answering under sticky TGDs is in the highly tractable class ac0 in the data complexity.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, Buenos Aires, Argentina, May 17-20, 2010 |
| Publisher | CEUR Workshop Proceedings (CEUR-WS.org) |
| Number of pages | 12 |
| Publication status | Published - 2010 |