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...
Main Authors: | Gottlob, G, Barceló, P, Pieris, A |
---|---|
格式: | Conference item |
出版: |
Association for Computing Machinery
2016
|
相似書籍
-
Semantic acyclicity under constraints
由: Barceló, P, et al.
出版: (2016) -
Semantic optimization of conjunctive queries
由: Barcelo, P, et al.
出版: (2020) -
The complexity of acyclic conjunctive queries
由: Gottlob, G, et al.
出版: (2001) -
The Complexity of Acyclic Conjunctive Queries
由: Gottlob, G, et al.
出版: (1998) -
Expressive languages for querying the semantic web
由: Arenas, M, et al.
出版: (2018)