Computing Query Answers in Databases
Integrity constraints have long been used to maintain data consistency, however, there are situations in which they may not be satisfied. For example, when it is the result of integrating several independent data sources.In this paper, we propose a new query method in inconsistent databases based on the probabilistic database, and make use of the output of a tuple matching technique to assign probabilities and clusters for inconsistent databases. We consider the SPJ queries with aggregation functions, and present three rewriting strategies with non-join and join predicates. The rewriting strategy of join queries condenses the number of tuples in the result sets to enhance the performance of queries. The method is applicable for commerciai database systems, and the rewritten queries can be efficiently optimized and executed. We use the TPC-H specification to compare the rewriting strategies; the experiments show that our method is flexible.
relation database probabilistic databases inconsistent database, query rewriting
XIE Dong YANG Luming
College of Information Science and Engineering Central South University Changsha 410083, China
国际会议
武汉
英文
503-508
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）