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...
Asıl Yazarlar: | Gottlob, G, Barceló, P, Pieris, A |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
Association for Computing Machinery
2016
|
Benzer Materyaller
-
Semantic acyclicity under constraints
Yazar:: Barceló, P, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
Semantic optimization of conjunctive queries
Yazar:: Barcelo, P, ve diğerleri
Baskı/Yayın Bilgisi: (2020) -
The complexity of acyclic conjunctive queries
Yazar:: Gottlob, G, ve diğerleri
Baskı/Yayın Bilgisi: (2001) -
The Complexity of Acyclic Conjunctive Queries
Yazar:: Gottlob, G, ve diğerleri
Baskı/Yayın Bilgisi: (1998) -
Expressive languages for querying the semantic web
Yazar:: Arenas, M, ve diğerleri
Baskı/Yayın Bilgisi: (2018)