Uncertain information is commonplace in real-world data management scenarios. An important challenge in this context is the ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing. The recent formalism of world-set decompositions (WSDs) provides a space-efficient representation for uncertain data that also supports scalable processing. WSDs are complete for finite world-sets in that they can represent any finite set of possible worlds. For possibly infinite world-sets, we show that a natural generalization of WSDs precisely captures the expressive power of c-tables. We then show that several important problems are efficiently solvable on WSDs while they are NP-hard on c-tables. Finally, we give a polynomial-time algorithm for factorizing WSDs, i.e. an efficient algorithm for minimizing such representations. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Antova, L., Koch, C., & Olteanu, D. (2006). World-set decompositions: Expressiveness and efficient algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4353 LNCS, pp. 194–208). https://doi.org/10.1007/11965893_14
Mendeley helps you to discover research relevant for your work.