The Community for Technology Leaders
2015 IEEE 31st International Conference on Data Engineering (ICDE) (2015)
Seoul, South Korea
April 13, 2015 to April 17, 2015
ISBN: 978-1-4799-7964-6
pp: 89-100
Xian Li , Computer Science Department of Binghamton University, USA
Xin Luna Dong , Google Inc, USA
Kenneth B. Lyons , AT&T Labs-Research, USA
Weiyi Meng , Computer Science Department of Binghamton University, USA
Divesh Srivastava , AT&T Labs-Research, USA
ABSTRACT
Recent research shows that copying is prevalent for Deep-Web data and considering copying can significantly improve truth finding from conflicting values. However, existing copy detection techniques do not scale for large sizes and numbers of data sources, so truth finding can be slowed down by one to two orders of magnitude compared with the corresponding techniques that do not consider copying. In this paper, we study how to improve scalability of copy detection on structured data. Our algorithm builds an inverted index for each shared value and processes the index entries in decreasing order of how much the shared value can contribute to the conclusion of copying. We show how we use the index to prune the data items we consider for each pair of sources, and to incrementally refine our results in iterative copy detection. We also apply a sampling strategy with which we are able to further reduce copy-detection time while still obtaining very similar results as on the whole data set. Experiments on various real data sets show that our algorithm can reduce the time for copy detection by two to three orders of magnitude; in other words, truth finding can benefit from copy detection with very little overhead.
INDEX TERMS
Indexes, Accuracy, Scalability, Distributed databases, Buildings, Convergence, Knowledge based systems
CITATION

X. Li, X. L. Dong, K. B. Lyons, W. Meng and D. Srivastava, "Scaling up copy detection," 2015 IEEE 31st International Conference on Data Engineering (ICDE), Seoul, South Korea, 2015, pp. 89-100.
doi:10.1109/ICDE.2015.7113275
98 ms
(Ver 3.3 (11022016))