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...
Main Authors: | Cautis, B, Kharlamov, E |
---|---|
格式: | Journal article |
語言: | English |
出版: |
2012
|
相似書籍
-
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
由: Cautis, B, et al.
出版: (2012) -
Capturing continuous data and answering aggregate queries in probabilistic XML.
由: Abiteboul, S, et al.
出版: (2011) -
Capturing continuous data and answering aggregate queries in probabilistic XML
由: Abiteboul, S, et al.
出版: (2011) -
Tractable Query Answering over Conceptual Schemata
由: Calì, A, et al.
出版: (2009) -
Tractable Query Answering over Ontologies with Datalog+⁄−
由: Calì, A, et al.
出版: (2009)