The Hybrid Probabilistic Query Algorithms Based on Inconsistent Database

Abstract

Integrity constraint is important to make data certain in relation database. Though there is plenty of uncertain information that is valuable and need to be searched and to be used. Combined with probabilistic database theory and on the basis of summarizing former results, this paper gives a new query plan aiming at inconsistent database. It uses the constraint methods including union, product, subtraction, selection, projection and link to repair inconsistent data effectively. Its probabilistic calculation with four elements and probabilistic query rewriting can overcome shortcomings of inconsistent databases. The experiments show these methods can decrease conflict of data.