Fast and Simple Relational Processing of Uncertain Data

Details Fast and Simple Relational Processing of Uncertain Data Fast and Simple Relational Processing of Uncertain Data

2007-07-11

arxiv.org/abs/0707.1644v1

Computer Science

Databases

12 pages, 14 figures

Scientific paper

This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If we consider positive relational algebra extended by an operation for computing possible answers, a query on the logical level can be translated into, and evaluated as, a single relational algebra query on the U-relation representation. The translation scheme essentially preserves the size of the query in terms of number of operations and, in particular, number of joins. Standard techniques employed in off-the-shelf relational database management systems are effective for optimizing and processing queries on U-relations. In our experiments we show that query evaluation on U-relations scales to large amounts of data with high degrees of uncertainty.

Affiliated with

Also associated with

No associations

Rating

Fast and Simple Relational Processing of Uncertain Data 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 Fast and Simple Relational Processing of Uncertain Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast and Simple Relational Processing of Uncertain Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435211