Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semantic representations and query languages for or-sets
Journal of Computer and System Sciences
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
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
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Materialized views in probabilistic databases: for information exchange and query optimization
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Fast and Simple Relational Processing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
On Query Algebras for Probabilistic Databases
ACM SIGMOD Record
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On probabilistic fixpoint and Markov chain query languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
| Hi-index | 0.00 |
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. This paper shows that world-set algebra captures exactly second-order logic over finite structures, or equivalently, the polynomial hierarchy. The proofs also imply that world-set algebra is closed under composition, a previously open problem.