Semantic acyclicity under constraints

A conjunctive query (CQ) is semantically acyclic if it is equivalent to an acyclic one. Semantic acyclicity has been studied in the constraint-free case, and deciding whether a query enjoys this property is NP-complete. However, in case the database is subject to constraints such as tuple-generating...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Gottlob, G, Barceló, P, Pieris, A
Formáid: Conference item
Foilsithe / Cruthaithe: Association for Computing Machinery 2016

Míreanna comhchosúla