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...
Κύριοι συγγραφείς: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Μορφή: | Journal article |
Έκδοση: |
Association for Computing Machinery
2017
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Classification of annotation semirings over query containment
ανά: Kostylev, E, κ.ά.
Έκδοση: (2012) -
Classification of annotation semirings over query containment
ανά: Kostylev, E, κ.ά.
Έκδοση: (2012) -
Containment of queries for graphs with data
ανά: Kostylev, E, κ.ά.
Έκδοση: (2017) -
Containment of data graph queries
ανά: Kostylev, E, κ.ά.
Έκδοση: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
ανά: Kostylev, E, κ.ά.
Έκδοση: (2013)