One-pass inconsistency detection algorithms for big data

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data in the real world is often dirty. Inconsistency is an important kind of dirty data. Before repairing inconsistency, we need to detect them first. The time complexities of current inconsistency detection algorithms are super-linear to the size of data and not suitable for big data. For inconsistency detection for big data, we develop an algorithm that detects inconsistency within one-pass scan of the data according to both the functional dependency (FD) and the conditional functional dependency (CFD). We compare our detection algorithm with existing approaches experimentally. Experimental results on real datasets show that our approach could detect inconsistency effectively and efficiently.

Cite

CITATION STYLE

APA

Zhang, M., Wang, H., Li, J., & Gao, H. (2016). One-pass inconsistency detection algorithms for big data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9642, pp. 82–98). Springer Verlag. https://doi.org/10.1007/978-3-319-32025-0_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free