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...
Huvudupphovsmän: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Materialtyp: | Journal article |
Publicerad: |
Association for Computing Machinery
2017
|
Liknande verk
Liknande verk
-
Classification of annotation semirings over query containment
av: Kostylev, E, et al.
Publicerad: (2012) -
Classification of annotation semirings over query containment
av: Kostylev, E, et al.
Publicerad: (2012) -
Containment of queries for graphs with data
av: Kostylev, E, et al.
Publicerad: (2017) -
Containment of data graph queries
av: Kostylev, E, et al.
Publicerad: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
av: Kostylev, E, et al.
Publicerad: (2013)