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...
Main Authors: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
פורמט: | Journal article |
יצא לאור: |
Association for Computing Machinery
2017
|
פריטים דומים
-
Classification of annotation semirings over query containment
מאת: Kostylev, E, et al.
יצא לאור: (2012) -
Classification of annotation semirings over query containment
מאת: Kostylev, E, et al.
יצא לאור: (2012) -
Containment of queries for graphs with data
מאת: Kostylev, E, et al.
יצא לאור: (2017) -
Containment of data graph queries
מאת: Kostylev, E, et al.
יצא לאור: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
מאת: Kostylev, E, et al.
יצא לאור: (2013)