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...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Journal article |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
2012
|
Search Result 1
Answering Queries using Views over Probabilistic XML: Complexity and Tractability
Baskı/Yayın Bilgisi 2012
Journal article