{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:42Z","timestamp":1740122382689,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["61732003","61832003"],"award-info":[{"award-number":["61732003","61832003"]}],"id":[{"id":"10.13039\/501100010903","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00760-y","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T19:02:27Z","timestamp":1621882947000},"page":"2443-2459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data source selection for approximate query"],"prefix":"10.1007","volume":"44","author":[{"given":"Hongjie","family":"Guo","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"key":"760_CR1","unstructured":"Codd EF et\u00a0al (1972) Relational completeness of data base sublanguages"},{"issue":"2","key":"760_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14778\/2535568.2448938","volume":"6","author":"XL Dong","year":"2012","unstructured":"Dong XL, Saha B, Srivastava D (2012) Less is more: selecting sources wisely for integration. Proc VLDB Endow 6(2):37\u201348","journal-title":"Proc VLDB Endow"},{"key":"760_CR3","doi-asserted-by":"crossref","unstructured":"Guo H, Li J, Gao H (2020)Selecting sources for query approximation with bounded resources. In: International conference on combinatorial optimization and applications. Springer, pp. 61\u201375","DOI":"10.1007\/978-3-030-64843-5_5"},{"issue":"3","key":"760_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"RM Karp","year":"1989","unstructured":"Karp RM, Luby M, Madras N (1989) Monte-Carlo approximation algorithms for enumeration problems. J Algorithms 10(3):429\u2013448","journal-title":"J Algorithms"},{"issue":"1","key":"760_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor JS (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"key":"760_CR6","doi-asserted-by":"crossref","unstructured":"Li L, Feng X, Shao H, Li J (2018) Source selection for inconsistency detection. In: International conference on database systems for advanced applications. Springer, pp. 370\u2013385","DOI":"10.1007\/978-3-319-91458-9_22"},{"key":"760_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ins.2018.11.029","volume":"479","author":"Y Lin","year":"2019","unstructured":"Lin Y, Wang H, Li J, Gao H (2019) Data source selection for information integration in big data era. Info Sci 479:197\u2013213","journal-title":"Info Sci"},{"key":"760_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, Cambridge"},{"issue":"1","key":"760_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"760_CR10","doi-asserted-by":"crossref","unstructured":"Rekatsinas T, Dong XL, Srivastava D (2014) Characterizing and selecting fresh data sources. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data. pp 919\u2013930","DOI":"10.1145\/2588555.2610504"},{"issue":"3","key":"760_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2732232.2732233","volume":"7","author":"M Salloum","year":"2013","unstructured":"Salloum M, Dong XL, Srivastava D, Tsotras VJ (2013) Online ordering of overlapping data sources. Proc VLDB Endow 7(3):133\u2013144","journal-title":"Proc VLDB Endow"},{"key":"760_CR12","doi-asserted-by":"crossref","unstructured":"Shachnai H, Tamir T (2018) Polynomial time approximation schemes. In: Handbook of approximation algorithms and Metaheuristics, 2nd edn. Chapman and Hall\/CRC, pp. 125\u2013156","DOI":"10.1201\/9781351236423-8"},{"issue":"3","key":"760_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.26599\/TST.2018.9010004","volume":"23","author":"J Sun","year":"2018","unstructured":"Sun J, Li J, Gao H, Wang H (2018) Truth discovery on inconsistent relational data. Tsinghua Sci Technol 23(3):288\u2013302","journal-title":"Tsinghua Sci Technol"},{"issue":"12","key":"760_CR14","first-page":"1587","volume":"11","author":"L Sun","year":"2000","unstructured":"Sun L, Hong Z, Pixing Z (2000) A randomized algorithm for the union of sets problem. J Softw 11(12):1587\u20131593","journal-title":"J Softw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00760-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00760-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00760-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:19:33Z","timestamp":1665778773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00760-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["760"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00760-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"15 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}