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

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

2008-07-29

arxiv.org/abs/0807.4620v1

Computer Science

Databases

22 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Compositional Query Algebra for Second-Order Logic and Uncertain Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Compositional Query Algebra for Second-Order Logic and Uncertain Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Compositional Query Algebra for Second-Order Logic and Uncertain Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38417