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...

ver descrição completa

Detalhes bibliográficos
Main Authors: Cautis, B, Kharlamov, E
Formato: Journal article
Idioma:English
Publicado em: 2012