A compositional query algebra for second-order logic and uncertain databases

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 worldset algebra is closed under composition, a previously open problem.

• Type: Conference
• Year: 2009
• Where: ICDT
• Authors: Christoph Koch
• Keywords: Database, ICDT 2009, Query Language, Uncertain Database System, World-set Algebra Captures