Classification of annotation semirings over containment of conjunctive queries
We study the problem of query containment of conjunctive queries over annotated databases. Annotations are typically attached to tuples and represent metadata, such as probability, multiplicity, comments, or provenance. It is usually assumed that annotations are drawn from a commutative semiring. Su...
Autors principals: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Format: | Journal article |
Publicat: |
Association for Computing Machinery
2017
|
Ítems similars
-
Classification of annotation semirings over query containment
per: Kostylev, E, et al.
Publicat: (2012) -
Classification of annotation semirings over query containment
per: Kostylev, E, et al.
Publicat: (2012) -
Containment of queries for graphs with data
per: Kostylev, E, et al.
Publicat: (2017) -
Containment of data graph queries
per: Kostylev, E, et al.
Publicat: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
per: Kostylev, E, et al.
Publicat: (2013)