Fast and simple relational processing of uncertain data

被引：63

作者：

Antova, Lyublena ^{[1
]}

Jansen, Thomas ^{[1
]}

Koch, Christoph ^{[1
]}

Olteanu, Dan ^{[1
]}

机构：

[1] Univ Saarland, Database Grp, D-6600 Saarbrucken, Germany

来源：

2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3 | 2008年

关键词：

D O I：

10.1109/ICDE.2008.4497507

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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-relational 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.

引用

页码：983 / 992

页数：10