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)