Journal article icon

Journal article

World-set decompositions: expressiveness and efficient algorithms

Abstract:

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...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1016/j.tcs.2008.05.004

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical & Life Sciences Division - Department of Computer Science
More by this author
Institution:
Cornell University
More by this author
Institution:
Cornell University
Publisher:
Elsevier Publisher's website
Journal:
Theoretical Computer Science Journal website
Volume:
403
Issue:
2-3
Pages:
265–284
Publication date:
2008-08-05
DOI:
ISSN:
0304-3975
URN:
uuid:f3203a80-a683-4f37-b700-e7ef1f8bb779
Local pid:
ora:10788

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP