{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:55:51Z","timestamp":1743123351637,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594091"},{"type":"electronic","value":"9783030594107"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59410-7_13","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:57:43Z","timestamp":1600707463000},"page":"211-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Source Selection for Error Detection via Matching Dependencies"],"prefix":"10.1007","author":[{"given":"Lingli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"13_CR2","series-title":"Data-Centric Systems and Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16518-4","volume-title":"Schema Matching and Mapping","author":"Z Bellahsene","year":"2011","unstructured":"Bellahsene, Z., Bonifati, A., Rahm, E.: Schema Matching and Mapping. Data-Centric Systems and Applications. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-16518-4"},{"doi-asserted-by":"crossref","unstructured":"Christen, P.: Febrl - an open source data cleaning, deduplication and record linkage system with a graphical user interface. In: SIGKDD (2008)","key":"13_CR3","DOI":"10.1145\/1401890.1402020"},{"issue":"9","key":"13_CR4","first-page":"1537","volume":"24","author":"P Christen","year":"2012","unstructured":"Christen, P.: A survey of indexing techniques for scalable record linkage and deduplication. TKDE 24(9), 1537\u20131555 (2012)","journal-title":"TKDE"},{"issue":"1","key":"13_CR5","first-page":"64","volume":"13","author":"E Cohen","year":"2001","unstructured":"Cohen, E., et al.: Finding interesting associations without support pruning. TKDE 13(1), 64\u201378 (2001)","journal-title":"TKDE"},{"issue":"2","key":"13_CR6","first-page":"37","volume":"6","author":"XL Dong","year":"2012","unstructured":"Dong, X.L., Saha, B., Srivastava, D.: Less is more: selecting sources wisely for integration. VLDB 6(2), 37\u201348 (2012)","journal-title":"VLDB"},{"doi-asserted-by":"crossref","unstructured":"Fan, W.: Dependencies revisited for improving data quality. In: PODS, pp. 159\u2013170 (2008)","key":"13_CR7","DOI":"10.1145\/1376916.1376940"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1366102.1366103","volume":"33","author":"W Fan","year":"2008","unstructured":"Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. TODS 33(2), 6 (2008)","journal-title":"TODS"},{"doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F., Ma S., M\u00fcller, H.: Detecting inconsistencies in distributed data. In: ICDE, pp. 64\u201375. IEEE (2010)","key":"13_CR9","DOI":"10.1109\/ICDE.2010.5447855"},{"issue":"6","key":"13_CR10","first-page":"1367","volume":"26","author":"W Fan","year":"2014","unstructured":"Fan, W., Li, J., Tang, N., et al.: Incremental detection of inconsistencies in distributed data. TKDE 26(6), 1367\u20131383 (2014)","journal-title":"TKDE"},{"issue":"1","key":"13_CR11","first-page":"201","volume":"1","author":"M Hadjieleftheriou","year":"2008","unstructured":"Hadjieleftheriou, M., Yu, X., Koudas, N., Srivastava, D.: Hashed samples: selectivity estimators for set similarity selection queries. PVLDB 1(1), 201\u2013212 (2008)","journal-title":"PVLDB"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ins.2016.02.003","volume":"346\u2013347","author":"C He","year":"2016","unstructured":"He, C., Tan, Z.T., Chen, Q., Sha, C.: Repair diversification: a new approach for data repairing. Inf. Sci. 346\u2013347, 90\u2013105 (2016)","journal-title":"Inf. Sci."},{"unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Approximation Algorithms for NP-Hard Problems, pp. 94\u2013143. PWS Publishing Co. (1996)","key":"13_CR13"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ins.2016.01.051","volume":"345","author":"C Jin","year":"2016","unstructured":"Jin, C., Lall, A., Jun, X., Zhang, Z., Zhou, A.: Distributed error estimation of functional dependency. Inf. Sci. 345, 156\u2013176 (2016)","journal-title":"Inf. Sci."},{"issue":"6","key":"13_CR15","first-page":"338","volume":"4","author":"H Lee","year":"2011","unstructured":"Lee, H., Ng, R.T., Shim, K.: Similarity join size estimation using locality sensitive hashing. PVLDB 4(6), 338\u2013349 (2011)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Li, L., Feng, X., Shao, H., Li, J.: Source selection for inconsistency detection, pp. 370\u2013385 (2018)","key":"13_CR16","DOI":"10.1007\/978-3-319-91458-9_22"},{"issue":"2","key":"13_CR17","first-page":"97","volume":"6","author":"X Li","year":"2012","unstructured":"Li, X., Dong, X.L., Lyons, K., Meng, W., Srivastava, D.: Truth finding on the deep web: is the problem solved? VLDB 6(2), 97\u2013108 (2012)","journal-title":"VLDB"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Pochampally, R., Sarma, A.D., Dong, X.L., Meliou, A., Srivastava, D.: Fusing data with correlations. In: SIGMOD, pp. 433\u2013444. ACM (2014)","key":"13_CR19","DOI":"10.1145\/2588555.2593674"},{"unstructured":"Rafiei, D., Deng, F.: Similarity join and self-join size estimation in a streaming environment. CoRR, abs\/1806.03313 (2018)","key":"13_CR20"},{"unstructured":"Rekatsinas, T., Dong, X.L., Getoor, L., Srivastava., D.: Finding quality in quantity: the challenge of discovering valuable sources for integration. In: CIDR (2015)","key":"13_CR21"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10115-018-1284-9","volume":"61","author":"C Ye","year":"2019","unstructured":"Ye, C., Li, Q., Zhang, H., Wang, H., Gao, J., Li, J.: AutoRepair: an automatic repairing approach over multi-source data. Knowl. Inf. Syst. 61(1), 227\u2013257 (2019)","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Zheng, Z., Milani, M., Chiang, F.: CurrentClean: spatio-temporal cleaning of stale data, pp. 172\u2013183 (2019)","key":"13_CR23","DOI":"10.1109\/ICDE.2019.00024"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59410-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:49:33Z","timestamp":1710269373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59410-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594091","9783030594107"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59410-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}