{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:17:47Z","timestamp":1743092267403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260712"},{"type":"electronic","value":"9783030260729"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-26072-9_5","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:05:48Z","timestamp":1564009548000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Drawing CoCo Core-Sets from\u00a0Incomplete Relational Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8178-5441","authenticated-orcid":false,"given":"Yongnan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Mozafari, B., Panda, A., Milner, H., Madden, S., Stoica, I.: BlinkDB: queries with bounded errors and bounded response times on very large data. In: Proceedings of the 8th ACM European Conference on Computer Systems, pp. 29\u201342. ACM (2013)","DOI":"10.1145\/2465351.2465355"},{"key":"5_CR3","first-page":"1","volume":"27","author":"M Brucato","year":"2017","unstructured":"Brucato, M., Abouzied, A., Meliou, A.: Package queries: efficient and scalable computation of high-order constraints. VLDB J. 27, 1\u201326 (2017)","journal-title":"VLDB J."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, S., Cai, Z., Li, J., Fang, X.: Drawing dominant dataset from big sensory data in wireless sensor networks. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 531\u2013539. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218420"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, S., Li, J.: Sampling based ($$\\epsilon , \\delta $$)-approximate aggregation algorithm in sensor networks. In: 29th IEEE International Conference on Distributed Computing Systems, ICDCS 2009, pp. 273\u2013280. IEEE (2009)","DOI":"10.1109\/ICDCS.2009.8"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chu, X., et al.: Katara: a data cleaning system powered by knowledge bases and crowdsourcing. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1247\u20131261. ACM (2015)","DOI":"10.1145\/2723372.2749431"},{"issue":"10","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.14778\/3115404.3115414","volume":"10","author":"Y Chung","year":"2017","unstructured":"Chung, Y., Krishnan, S., Kraska, T.: A data quality metric (DQM): how to estimate the number of undetected errors in data sets. Proc. VLDB Endow. 10(10), 1094\u20131105 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.14778\/1453856.1453884","volume":"1","author":"E Cohen","year":"2008","unstructured":"Cohen, E., Kaplan, H.: Tighter estimation using bottom k sketches. Proc. VLDB Endow. 1(1), 213\u2013224 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Deng, T., Fan, W., Geerts, F.: On the complexity of package recommendation problems. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2012, pp. 261\u2013272 (2012)","DOI":"10.1145\/2213556.2213592"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.is.2014.08.002","volume":"48","author":"T Deng","year":"2015","unstructured":"Deng, T., Fan, W., Geerts, F.: On recommendation problems beyond points of interest. Inf. Syst. 48, 64\u201388 (2015)","journal-title":"Inf. Syst."},{"issue":"9","key":"5_CR11","doi-asserted-by":"publisher","first-page":"938","DOI":"10.14778\/2777598.2777603","volume":"8","author":"Xin Luna Dong","year":"2015","unstructured":"Dong, X.L., et al.: Knowledge-based trust: estimating the trustworthiness of web sources. Proc. VLDB Endow. 8(9), 938\u2013949 (2015)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/2854006.2854008","volume":"44","author":"W Fan","year":"2015","unstructured":"Fan, W.: Data quality: from theory to practice. ACM SIGMOD Rec. 44(3), 7\u201318 (2015)","journal-title":"ACM SIGMOD Rec."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F.: Capturing missing tuples and missing values. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 169\u2013178. ACM, June 2010","DOI":"10.1145\/1807085.1807109"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hao, S., Tang, N., Li, G., Li, J.: Cleaning relations using knowledge bases. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 933\u2013944. IEEE (2017)","DOI":"10.1109\/ICDE.2017.141"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2014, pp. 100\u2013108. ACM (2014)","DOI":"10.1145\/2594538.2594560"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Khalefa, M.E., Mokbel, M.F., Levandoski, J.J.: Skyline query processing for incomplete data. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 556\u2013565. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497464"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1109\/TKDE.2015.2460742","volume":"28","author":"X Miao","year":"2016","unstructured":"Miao, X., Gao, Y., Zheng, B., Chen, G., Cui, H.: Top-k dominating queries on incomplete data. IEEE Trans. Knowl. Data Eng. 28(1), 252\u2013266 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9486"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Razniewski, S., Korn, F., Nutt, W., Srivastava, D.: Identifying the extent of completeness of query answers over partially complete databases. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 561\u2013576. ACM (2015)","DOI":"10.1145\/2723372.2750544"},{"issue":"11","key":"5_CR20","doi-asserted-by":"crossref","first-page":"749","DOI":"10.14778\/3402707.3402715","volume":"4","author":"S Razniewski","year":"2011","unstructured":"Razniewski, S., Nutt, W.: Completeness of queries over incomplete databases. Proc. VLDB Endow. 4(11), 749\u2013760 (2011)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.14778\/3137628.3137631","volume":"10","author":"T Rekatsinas","year":"2017","unstructured":"Rekatsinas, T., Chu, X., Ilyas, I.F., R\u00e9, C.: Holoclean: holistic data repairs with probabilistic inference. Proc. VLDB Endow. 10(11), 1190\u20131201 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/3186549.3186559","volume":"46","author":"S Sadiq","year":"2018","unstructured":"Sadiq, S., et al.: Data quality: the role of empiricism. SIGMOD Rec. 46(4), 35\u201343 (2018)","journal-title":"SIGMOD Rec."},{"issue":"11","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.14778\/2809974.2809989","volume":"8","author":"S Song","year":"2015","unstructured":"Song, S., Zhang, A., Chen, L., Wang, J.: Enriching data imputation with extensive similarity neighbors. Proc. VLDB Endow. 8(11), 1286\u20131297 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. (TOMS) 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26072-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:23:17Z","timestamp":1709810597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26072-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260712","9783030260729"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26072-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","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":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"42","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":"17","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":"23% - 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","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}