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...
主要な著者: | Gottlob, G, Barceló, P, Pieris, A |
---|---|
フォーマット: | Conference item |
出版事項: |
Association for Computing Machinery
2016
|
類似資料
-
Semantic acyclicity under constraints
著者:: Barceló, P, 等
出版事項: (2016) -
Semantic optimization of conjunctive queries
著者:: Barcelo, P, 等
出版事項: (2020) -
The complexity of acyclic conjunctive queries
著者:: Gottlob, G, 等
出版事項: (2001) -
The Complexity of Acyclic Conjunctive Queries
著者:: Gottlob, G, 等
出版事項: (1998) -
Expressive languages for querying the semantic web
著者:: Arenas, M, 等
出版事項: (2018)