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...
主要な著者: | Cautis, B, Kharlamov, E |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2012
|
類似資料
-
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
著者:: Cautis, B, 等
出版事項: (2012) -
Capturing continuous data and answering aggregate queries in probabilistic XML.
著者:: Abiteboul, S, 等
出版事項: (2011) -
Capturing continuous data and answering aggregate queries in probabilistic XML
著者:: Abiteboul, S, 等
出版事項: (2011) -
Tractable Query Answering over Conceptual Schemata
著者:: Calì, A, 等
出版事項: (2009) -
Tractable Query Answering over Ontologies with Datalog+⁄−
著者:: Calì, A, 等
出版事項: (2009)