A Compositional Query Algebra for Second-Order Logic and Uncertain Databases

A Compositional Query Algebra for Second-Order Logic and Uncertain Databases (2009)

by Christoph Koch

Venue:	In Proc. ICDT
Citations:	7 - 4 self

Datum	Value	Source
TITLE	A Compositional Query Algebra for Second-Order Logic and Uncertain Databases	SVM HeaderParse 0.2
AUTHOR NAME	Christoph Koch	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; Cornell University, Ithaca	SVM HeaderParse 0.2
AUTHOR ADDR	NY, USA	SVM HeaderParse 0.2
ABSTRACT	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. 1.	SVM HeaderParse 0.2
YEAR	2009	INFERENCE
VENUE	In Proc. ICDT	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	20 found	ParsCit 1.0