Efficient Query Evaluation on Probabilistic Databases

DMCA

Efficient Query Evaluation on Probabilistic Databases (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nilesh Dalvi , Dan Suciu

Citations:

450 - 44 self

BibTeX

@MISC{Dalvi04efficientquery,
    author = {Nilesh Dalvi and Dan Suciu},
    title = {Efficient Query Evaluation on Probabilistic Databases},
    year = {2004}
}

OpenURL

Abstract

We describe a system that supports arbitrarily complex SQL queries with ”uncertain” predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is efficient query evaluation, a problem that has not received attention in the past. We describe an optimization algorithm that can compute efficiently most queries. We show, however, that the data complexity of some queries is #P-complete, which implies that these queries do not admit any efficient evaluation methods. For these queries we describe both an approximation algorithm and a Monte-Carlo simulation algorithm.

Keyphrases

efficient query evaluation probabilistic database uncertain predicate main focus query semantics complex sql query information retrieval monte-carlo simulation algorithm efficient evaluation method approximation algorithm data complexity probabilistic model optimization algorithm

DMCA