Dong Xie
Department of Computer Science and Technology, Hunan University of Humanities, Science and Technology, Loudi, China
Song Tang
Institute of Network Media and Public Sentiment, Hunan Mass Media Vacational Technical College, Changsha, China
Huijun Wang
Institute of Network Media and Public Sentiment, Hunan Mass Media Vacational Technical College, Changsha, China
Guangjun Guo
Department of Electronics and Information Engineering, Loudi Vocational and Technical College, Loudi, China
Yun Cheng
Department of Computer Science and Technology, Hunan University of Humanities, Science and Technology, Loudi, China
ABSTRACT
Inconsistency may arise when data are integrated together with respect to a given set of integrity constraints. Many techniques can identify inconsistent data by ad-hoc ways but inconsistent data can not be managed effectively. To judge a query is rewritable, the work analyses whether the join graph for the query is directed. Also, the work presents an approach for computing tuple probabilities and a basic technique for query rewriting. The experiments use the data and queries of the TPC-H specification to compare performance for degrees of inconsistencies and the results show that the approach is effective and feasible.
PDF References Citation
How to cite this article
Dong Xie, Song Tang, Huijun Wang, Guangjun Guo and Yun Cheng, 2013. Rewriting Queries for Inconsistent Data Based on Directed Join Graphs. Information Technology Journal, 12: 8035-8039.
DOI: 10.3923/itj.2013.8035.8039
URL: https://scialert.net/abstract/?doi=itj.2013.8035.8039
DOI: 10.3923/itj.2013.8035.8039
URL: https://scialert.net/abstract/?doi=itj.2013.8035.8039
REFERENCES
- Andritsos, P., A. Fuxman and R.J. Miller, 2006. Clean answers over dirty databases: A probabilistic approach. Proceeding of the IEEE 22nd International Conference on Data Engineering Workshops, April 3-7, 2006, Washington, DC, USA., 30.
CrossRef - Arenas, M., L. Bertossi and J. Chomicki, 1999. Consistent query answers in inconsistent databases. Proceedings of the 18th ACM Sigmod-Sigact-Sigart Symposium on Principles of Database Systems, May 31-June 3, 1999, Philadelphia, PA, USA., pp: 68-79.
CrossRef - Dalvi, N. and D. Suciu, 2004. Efficient query evaluation on probabilistic databases. Proceedings of the 30th Very Large Data Bases Conference, (VLDB'04), Toronto, Canada, pp: 864-875.
Direct Link - Fuhr, N. and T. Rolleke, 1997. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inform. Syst., 15: 32-66.
Direct Link - Hernandez, M.A. and S.J. Stolfo, 1998. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Mining Knowledge Discov., 2: 9-37.
CrossRef - Xie, D., Chen, X.B. and Y. Zhu, 2012. Obtaining certain results by query rewriting over uncertain database. Advance. Intell. Soft Comput., 162: 401-405.
CrossRef - Xie, D., Chen, X.B. and Y. Zhu, 2012. Tackling polytype queries in inconsistent databases: Theory and algorithm. J. Software, 7: 1861-1866.
Direct Link