We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system for finite sets of worlds. We study the problem of efficiently evaluating relational algebra queries on world-sets represented by WSDs. We also evaluate our technique experimentally in a large census data scenario and show that it is both scalable and efficient.
$${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information
Lyublena Antova,Christoph E. Koch,Dan Olteanu
Published 2006 in IEEE International Conference on Data Engineering
ABSTRACT
PUBLICATION RECORD
- Publication year
2006
- Venue
IEEE International Conference on Data Engineering
- Publication date
2006-06-16
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-39 of 39 references · Page 1 of 1