Dichotomies for Queries with Negation in Probabilistic Databases

DOI10.1145/2877203MaRDI QIDQ5012549zbMATH OpenOpenAlexFDO

Authors Robert Fink, Dan Olteanu

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:079c3f91-cc71-4e05-b388-ab10ed88f456

zbMATH Keywords

complexity dichotomyknowledge compilationprobabilistic databases

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The dichotomy of probabilistic inference for unions of conjunctive queries
• About yes/no queries against possibilistic databases
• Query evaluation in probabilistic relational databases
• Probabilistic query answering over inconsistent databases
• Querying possibilistic databases: three interpretations
• scientific article; zbMATH DE number 513103

Cited in

(7)

• Query answering over inconsistent knowledge bases: a probabilistic approach
• Open-world probabilistic databases: semantics, algorithms, complexity
• The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs
• Uniform Reliability of Self-Join-Free Conjunctive Queries
• The dichotomy of probabilistic inference for unions of conjunctive queries
• Rewriting with Acyclic Queries: Mind Your Head
• Combining intensional with extensional query evaluation in tuple independent probabilistic databases

This page was built for publication: Dichotomies for Queries with Negation in Probabilistic Databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012549)