Institutional Repository
| Consistent query answering based on repairing inconsistent attributes with nulls | |
| Liu, Jie (1); Ye, Dan (1); Wei, Jun (1); Huang, Fei (1); Zhong, Hua (1) | |
| 2013 | |
| Conference Name | 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013 |
| Pages | 407-423 |
| Conference Date | April 22, 2013 - April 25, 2013 |
| Conference Place | Wuhan, China |
| Indexed Type | EI |
| Publish Place | Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany |
| ISSN | 3029743 |
| ISBN | 9783642374869 |
| Department | (1) Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China |
| English Abstract | Although integrity constraints can successfully capture data semantics, the actual data in the database often violates such constraints. A Consistent Query Answer (CQA) in a possibly inconsistent database is an answer which is true in every minimal repair of the database. It has been proved that for most constraints and queries CQA is a NP problem based on repairing by tuple deletions or tuple insertions. Furthermore, repairing by deleting tuples will also cause information losing. In this paper we present a new repair semantics named repairing with nulls, which replaces the inconsistent attribute values with nulls. To capture all the inconsistent attribute values, we study the transitivity of nulls and provide an algorithm to extend the original constraints. Based on repairing with nulls, there will be only one repair and CQA can be computed in PTIME by SQL query rewriting. Finally, we study the performance of our new approach for CQA by detailed experiments. © Springer-Verlag 2013.; Although integrity constraints can successfully capture data semantics, the actual data in the database often violates such constraints. A Consistent Query Answer (CQA) in a possibly inconsistent database is an answer which is true in every minimal repair of the database. It has been proved that for most constraints and queries CQA is a NP problem based on repairing by tuple deletions or tuple insertions. Furthermore, repairing by deleting tuples will also cause information losing. In this paper we present a new repair semantics named repairing with nulls, which replaces the inconsistent attribute values with nulls. To capture all the inconsistent attribute values, we study the transitivity of nulls and provide an algorithm to extend the original constraints. Based on repairing with nulls, there will be only one repair and CQA can be computed in PTIME by SQL query rewriting. Finally, we study the performance of our new approach for CQA by detailed experiments. © Springer-Verlag 2013. |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16669 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Liu, Jie ,Ye, Dan ,Wei, Jun ,et al. Consistent query answering based on repairing inconsistent attributes with nulls[C]. Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany,2013:407-423. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment