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)