Answering Queries using Views over Probabilistic XML: Complexity and Tractability

Answering Queries using Views over Probabilistic XML: Complexity and Tractability

Show other versions (1)

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

Registos relacionados

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

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

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

Tractable Query Answering over Conceptual Schemata
Por: Calì, A, et al.
Publicado em: (2009)

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

Tractable Query Answering over Conceptual Schemata (Extended Abstract)
Por: Calì, A, et al.
Publicado em: (2010)

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

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

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

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

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

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

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

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

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

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

Evaluation of relational algebra queries on probabilistic databases: tractability and approximation
Por: Fink, RD
Publicado em: (2014)

On Tractable Queries and Constraints
Por: Gottlob, G, et al.
Publicado em: (1999)

Enhance efficiency of answering XML keyword query using incompact structure of MCCTree
Por: Sazaly, Ummu Sulaim
Publicado em: (2012)

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

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

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1998)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (2002)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1999)

Hypertree Decompositions and Tractable Queries
Por: Gottlob, G, et al.
Publicado em: (1999)

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

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

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

Probabilistic XML via Markov Chains
Por: Benedikt, M, et al.
Publicado em: (2010)

Probabilistic XML via Markov Chains.
Por: Benedikt, M, et al.
Publicado em: (2010)

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

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

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

The complexity of XPath query evaluation and XML typing
Por: Gottlob, G, et al.
Publicado em: (2005)

Causality and tractable probabilistic models
Por: David Cruz, et al.
Publicado em: (2024-01-01)

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

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

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

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

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