Boolean tensor decomposition for conjunctive queries with negation
We propose an approach for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the InsideOut and PANDA algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
Schloss Dagstuhl
2019
|