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...
Egile Nagusiak: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Formatua: | Journal article |
Argitaratua: |
Association for Computing Machinery
2017
|
Antzeko izenburuak
-
Classification of annotation semirings over query containment
nork: Kostylev, E, et al.
Argitaratua: (2012) -
Classification of annotation semirings over query containment
nork: Kostylev, E, et al.
Argitaratua: (2012) -
Containment of queries for graphs with data
nork: Kostylev, E, et al.
Argitaratua: (2017) -
Containment of data graph queries
nork: Kostylev, E, et al.
Argitaratua: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
nork: Kostylev, E, et al.
Argitaratua: (2013)