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...
Main Authors: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Format: | Journal article |
Published: |
Association for Computing Machinery
2017
|
Similar Items
-
Classification of annotation semirings over query containment
by: Kostylev, E, et al.
Published: (2012) -
Classification of annotation semirings over query containment
by: Kostylev, E, et al.
Published: (2012) -
Containment of queries for graphs with data
by: Kostylev, E, et al.
Published: (2017) -
Containment of data graph queries
by: Kostylev, E, et al.
Published: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
by: Kostylev, E, et al.
Published: (2013)