Incomplete Information in Relational Databases
Journal of the ACM (JACM)
On the representation and querying of sets of possible worlds
Selected papers of the workshop on Deductive database theory
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dependency Satisfaction in Databases with Incomplete Information
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
IBM Journal of Research and Development - Mathematics and computing
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
ULDBs: databases with uncertainty and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
World-set decompositions: expressiveness and efficient algorithms
ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Models for incomplete and probabilistic information
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
XML with incomplete information: models, properties, and query answering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantics and evaluation of top-k queries in probabilistic databases
Distributed and Parallel Databases
Capturing missing tuples and missing values
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with incomplete information
Journal of the ACM (JACM)
Incomplete information and certain answers in general data models
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
FDB: a query engine for factorised relational databases
Proceedings of the VLDB Endowment
On minimal constraint networks
Artificial Intelligence
Aggregation and ordering in factorised databases
Proceedings of the VLDB Endowment
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 5.23 |
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. 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.