World-set decompositions: Expressiveness and efficient algorithms

DOI10.1016/j.tcs.2008.05.004zbMath1203.68042OpenAlexW2150137825MaRDI QIDQ944380

Lyublena Antova, Dan Olteanu, Christoph Koch

Publication date: 16 September 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:f3203a80-a683-4f37-b700-e7ef1f8bb779

zbMATH Keywords

incomplete informationdatabasesrepresentation systemsrelational factorization

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (6)

On minimal constraint networks ⋮ Containment of conjunctive queries on annotated relations ⋮ Unnamed Item ⋮ World-set decompositions: Expressiveness and efficient algorithms ⋮ Queries and materialized views on probabilistic databases ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

Cites Work

• Unnamed Item
• Unnamed Item
• World-set decompositions: Expressiveness and efficient algorithms
• On the representation and querying of sets of possible worlds
• The problem of incomplete information in relational databases
• Incomplete Information in Relational Databases
• Factoring logic functions
• Answer sets for consistent query answering in inconsistent databases
• Database Programming Languages

This page was built for publication: World-set decompositions: Expressiveness and efficient algorithms