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...
Główni autorzy: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Format: | Journal article |
Wydane: |
Association for Computing Machinery
2017
|
Podobne zapisy
-
Classification of annotation semirings over query containment
od: Kostylev, E, i wsp.
Wydane: (2012) -
Classification of annotation semirings over query containment
od: Kostylev, E, i wsp.
Wydane: (2012) -
Containment of queries for graphs with data
od: Kostylev, E, i wsp.
Wydane: (2017) -
Containment of data graph queries
od: Kostylev, E, i wsp.
Wydane: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
od: Kostylev, E, i wsp.
Wydane: (2013)