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...
Váldodahkkit: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Materiálatiipa: | Journal article |
Almmustuhtton: |
Association for Computing Machinery
2017
|
Geahča maid
-
Classification of annotation semirings over query containment
Dahkki: Kostylev, E, et al.
Almmustuhtton: (2012) -
Classification of annotation semirings over query containment
Dahkki: Kostylev, E, et al.
Almmustuhtton: (2012) -
Containment of queries for graphs with data
Dahkki: Kostylev, E, et al.
Almmustuhtton: (2017) -
Containment of data graph queries
Dahkki: Kostylev, E, et al.
Almmustuhtton: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
Dahkki: Kostylev, E, et al.
Almmustuhtton: (2013)