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.
%0 Book Section
%1 Antova2007WorldSet
%A Antova, Lyublena
%A Koch, Christoph
%A Olteanu, Dan
%D 2007
%J Database Theory – ICDT 2007
%K pdm
%P 194--208
%R http://dx.doi.org/10.1007/11965893\_14
%T World-Set Decompositions: Expressiveness and Efficient Algorithms
%U http://dx.doi.org/10.1007/11965893\_14
%X 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.
@incollection{Antova2007WorldSet,
abstract = {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.},
added-at = {2009-03-12T15:42:50.000+0100},
author = {Antova, Lyublena and Koch, Christoph and Olteanu, Dan},
biburl = {https://www.bibsonomy.org/bibtex/2fb0d069888f0c7eef7ac4cae697dbf8a/lillejul},
citeulike-article-id = {1419509},
doi = {http://dx.doi.org/10.1007/11965893\_14},
interhash = {96c09c92627d32258c5c763b6eabd6d5},
intrahash = {fb0d069888f0c7eef7ac4cae697dbf8a},
journal = {Database Theory – ICDT 2007},
keywords = {pdm},
pages = {194--208},
posted-at = {2007-06-28 13:54:57},
priority = {3},
timestamp = {2009-03-12T15:42:53.000+0100},
title = {World-Set Decompositions: Expressiveness and Efficient Algorithms},
url = {http://dx.doi.org/10.1007/11965893\_14},
year = 2007
}