The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this context. 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.arXiv:0705.4442v2 fatcat:lxycmuem6fdn5intgpswof2yq4