World-set decompositions: expressiveness and efficient algorithms
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 <em>world-set decompositions (WS...
Main Authors: | Olteanu, D, Koch, C, Antova, L |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2008
|
Subjects: |
Similar Items
-
Algorithmic verification problems in automata-theoretic settings
by: Bundala, D
Published: (2014) -
Algorithmic Randomness and Capacity of Closed Sets
by: Douglas Cenzer, et al.
Published: (2011-09-01) -
Optimizing tree decompositions in MSO
by: Mikołaj Bojańczyk, et al.
Published: (2022-02-01) -
Background math for a computer world /
by: 421711 Ashley, Ruth
Published: (1973) -
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Jan Dreier
Published: (2023-06-01)