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...
Asıl Yazarlar: | Kostylev, E, Reutter, J, Salamon, A |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
Association for Computing Machinery
2017
|
Benzer Materyaller
-
Classification of annotation semirings over query containment
Yazar:: Kostylev, E, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Classification of annotation semirings over query containment
Yazar:: Kostylev, E, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Containment of queries for graphs with data
Yazar:: Kostylev, E, ve diğerleri
Baskı/Yayın Bilgisi: (2017) -
Containment of data graph queries
Yazar:: Kostylev, E, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Complexity of answering counting aggregate queries over DL-Lite
Yazar:: Kostylev, E, ve diğerleri
Baskı/Yayın Bilgisi: (2013)