Answering Queries using Views over Probabilistic XML: Complexity and
Tractability

Answering Queries using Views over Probabilistic XML: Complexity and Tractability

Show other versions (1)

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

Bibliografske podrobnosti
Main Authors:	Cautis, B, Kharlamov, E
Format:	Journal article
Jezik:	English
Izdano:	2012

Podobne knjige/članki

Answering Queries using Views over Probabilistic XML: Complexity and Tractability
od: Cautis, B, et al.
Izdano: (2012)

Capturing continuous data and answering aggregate queries in probabilistic XML.
od: Abiteboul, S, et al.
Izdano: (2011)

Capturing continuous data and answering aggregate queries in probabilistic XML
od: Abiteboul, S, et al.
Izdano: (2011)

Tractable Query Answering over Conceptual Schemata
od: Calì, A, et al.
Izdano: (2009)

Tractable Query Answering over Ontologies with Datalog+⁄−
od: Calì, A, et al.
Izdano: (2009)

Tractable Query Answering over Conceptual Schemata (Extended Abstract)
od: Calì, A, et al.
Izdano: (2010)

Tractable query answering for description logics via query rewriting
od: Perez-Urbina, H, et al.
Izdano: (2010)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
od: Calì, A, et al.
Izdano: (2012)

A general Datalog-based framework for tractable query answering over ontologies.
od: Calì, A, et al.
Izdano: (2012)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
od: Calì, A, et al.
Izdano: (2012)

A general datalog-based framework for tractable query answering over ontologies.
od: Calì, A, et al.
Izdano: (2009)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
od: Calì, A, et al.
Izdano: (2009)

Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
od: Focke, J, et al.
Izdano: (2024)

Tractable query answering and rewriting under description logic constraints.
od: Pérez-Urbina, H, et al.
Izdano: (2010)

Tractable Query Answering and Rewriting under Description Logic Constraints
od: Pérez−Urbina, H, et al.
Izdano: (2009)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract)
od: Calì, A, et al.
Izdano: (2009)

Evaluation of relational algebra queries on probabilistic databases: tractability and approximation
od: Fink, RD
Izdano: (2014)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

Ranking Query Answers in Probabilistic Databases: Complexity and Efficient Algorithms
od: Olteanu, D, et al.
Izdano: (2012)

Complexity of Threshold Query Answering in Probabilistic Ontological Data Exchange
od: Lukasiewicz, T, et al.
Izdano: (2016)

Enhance efficiency of answering XML keyword query using incompact structure of MCCTree
od: Sazaly, Ummu Sulaim
Izdano: (2012)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1998)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (2002)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Ontology-mediated query answering over log-linear probabilistic data
od: Borgwardt, S, et al.
Izdano: (2019)

Ontology-mediated query answering over log-linear probabilistic data
od: Borgwardt, S, et al.
Izdano: (2019)

A tutorial on query answering and reasoning over probabilistic knowledge bases
od: Ceylan, I, et al.
Izdano: (2018)

Probabilistic XML via Markov Chains.
od: Benedikt, M, et al.
Izdano: (2010)

Probabilistic XML via Markov Chains
od: Benedikt, M, et al.
Izdano: (2010)

Answering Threshold Queries in Probabilistic Datalog+/- Ontologies.
od: Gottlob, G, et al.
Izdano: (2011)

Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies.
od: Gottlob, G, et al.
Izdano: (2011)

Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies
od: Gottlob, G, et al.
Izdano: (2011)

The complexity of XPath query evaluation and XML typing
od: Gottlob, G, et al.
Izdano: (2005)

Preference−Based Query Answering in Probabilistic Datalog+⁄− Ontologies
od: Lukasiewicz, T, et al.
Izdano: (2013)

Preference−Based Query Answering in Probabilistic Datalog+⁄− Ontologies
od: Lukasiewicz, T, et al.
Izdano: (2014)

Query Answering under Probabilistic Uncertainty in Datalog+⁄− Ontologies
od: Gottlob, G, et al.
Izdano: (2013)

Causality and tractable probabilistic models
od: David Cruz, et al.
Izdano: (2024-01-01)

Complexity of answering counting aggregate queries over DL-Lite
od: Kostylev, E, et al.
Izdano: (2013)

Complexity of answering counting aggregate queries over DL - Lite
od: Kostylev, E, et al.
Izdano: (2015)