World-set decompositions: Expressiveness and efficient algorithms
From MaRDI portal
Recommendations
- On the representation and querying of sets of possible worlds
- Size bounds for factorised representations of query results
- Efficient processing of probabilistic set-containment queries on uncertain set-valued data
- Efficient processing of similarity search on uncertain set-valued data
- Computing rarity on uncertain data
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Answer sets for consistent query answering in inconsistent databases
- Database Programming Languages
- Factoring logic functions
- Incomplete Information in Relational Databases
- On the representation and querying of sets of possible worlds
- The problem of incomplete information in relational databases
- World-set decompositions: Expressiveness and efficient algorithms
Cited in
(7)- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- On the representation and querying of sets of possible worlds
- scientific article; zbMATH DE number 7437710 (Why is no real title available?)
- On minimal constraint networks
- Containment of conjunctive queries on annotated relations
- World-set decompositions: Expressiveness and efficient algorithms
- Queries and materialized views on probabilistic databases
This page was built for publication: World-set decompositions: Expressiveness and efficient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944380)
