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...
Päätekijät: | Cautis, B, Kharlamov, E |
---|---|
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
2012
|
Samankaltaisia teoksia
-
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
Tekijä: Cautis, B, et al.
Julkaistu: (2012) -
Capturing continuous data and answering aggregate queries in probabilistic XML.
Tekijä: Abiteboul, S, et al.
Julkaistu: (2011) -
Capturing continuous data and answering aggregate queries in probabilistic XML
Tekijä: Abiteboul, S, et al.
Julkaistu: (2011) -
Tractable Query Answering over Conceptual Schemata
Tekijä: Calì, A, et al.
Julkaistu: (2009) -
Tractable Query Answering over Ontologies with Datalog+⁄−
Tekijä: Calì, A, et al.
Julkaistu: (2009)