Parallel Discrepancy Detection and Incremental Detection Academic Article uri icon

abstract

  • This paper studies how to catch duplicates, mismatches and conflicts in the same process. We adopt a class of entity enhancing rules that embed machine learning predicates, unify entity resolution and conflict resolution, and are collectively defined across multiple relations. We detect discrepancies as violations of such rules. We establish the complexity of discrepancy detection and incremental detection problems with the rules; they are both NP-complete and W[1]-hard. To cope with the intractability and scale with large datasets, we develop parallel algorithms and parallel incremental algorithms for discrepancy detection. We show that both algorithms are parallelly scalable, i.e. , they guarantee to reduce runtime when more processors are used. Moreover, the parallel incremental algorithm is relatively bounded. The complexity bounds and algorithms carry over to denial constraints, a special case of the entity enhancing rules. Using real-life and synthetic datasets, we experimentally verify the effectiveness, scalability and efficiency of the algorithms.

published proceedings

  • PROCEEDINGS OF THE VLDB ENDOWMENT

author list (cited authors)

  • Fan, W., Tian, C., Wang, Y., & Yin, Q.

citation count

  • 6

complete list of authors

  • Fan, Wenfei||Tian, Chao||Wang, Yanghao||Yin, Qiang

publication date

  • April 2021