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...
Príomhchruthaitheoirí: | Cautis, B, Kharlamov, E |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
2012
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
de réir: Cautis, B, et al.
Foilsithe / Cruthaithe: (2012) -
Capturing continuous data and answering aggregate queries in probabilistic XML.
de réir: Abiteboul, S, et al.
Foilsithe / Cruthaithe: (2011) -
Capturing continuous data and answering aggregate queries in probabilistic XML
de réir: Abiteboul, S, et al.
Foilsithe / Cruthaithe: (2011) -
Tractable Query Answering over Conceptual Schemata
de réir: Calì, A, et al.
Foilsithe / Cruthaithe: (2009) -
Tractable Query Answering over Ontologies with Datalog+⁄−
de réir: Calì, A, et al.
Foilsithe / Cruthaithe: (2009)