Answering Queries using Views over Probabilistic XML: Complexity and Tractability
We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries -- with child and descendant navigation and predicates -- for which there are efficient (PTime) algorithms. We consider this problem under the two possible semantics for...
Egile Nagusiak: | Cautis, B, Kharlamov, E |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
2012
|
Antzeko izenburuak
-
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
nork: Cautis, B, et al.
Argitaratua: (2012) -
Capturing continuous data and answering aggregate queries in probabilistic XML.
nork: Abiteboul, S, et al.
Argitaratua: (2011) -
Capturing continuous data and answering aggregate queries in probabilistic XML
nork: Abiteboul, S, et al.
Argitaratua: (2011) -
Tractable Query Answering over Conceptual Schemata
nork: Calì, A, et al.
Argitaratua: (2009) -
Tractable Query Answering over Ontologies with Datalog+⁄−
nork: Calì, A, et al.
Argitaratua: (2009)