{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:15Z","timestamp":1725552135223},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540329602"},{"type":"electronic","value":"9783540329619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11687238_48","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T07:05:50Z","timestamp":1141887950000},"page":"811-828","source":"Crossref","is-referenced-by-count":15,"title":["Query Planning in the Presence of Overlapping Sources"],"prefix":"10.1007","author":[{"given":"Jens","family":"Bleiholder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Naumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louiqa","family":"Raschid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","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, J.S.: The budgeted maximum coverage problem. Inf. Process. Lett.\u00a070, 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"48_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24745-6_14","volume-title":"Data Integration in the Life Sciences","author":"Z. Lacroix","year":"2004","unstructured":"Lacroix, Z., Murthy, H., Naumann, F., Raschid, L.: Links and paths through life sciences data\u00a0sources. In: Rahm, E. (ed.) DILS 2004. LNCS (LNBI), vol.\u00a02994, pp. 203\u2013211. Springer, Heidelberg (2004)"},{"key":"48_CR3","unstructured":"Mihaila, G., Naumann, F., Raschid, L., Vidal, M.E.: A data model and query language to explore enhanced links and paths in life science sources. In: Proceedings of the ACM SIGMOD Workshop on The Web and Databases, WebDB (2005)"},{"key":"48_CR4","unstructured":"Raschid, L., Vidal, M.E., Cardenas, M., Marquez, N., Wu, Y.: Challenges of navigational queries: Finding best paths in graphs. Technical report, University of Maryland (2005)"},{"key":"48_CR5","unstructured":"Khuller, S., Raschid, L., Wu, Y.: LP randomized rounding for maximum coverage problem and minimum set cover with threshold problem. Technical report, University of Maryland (2005)"},{"key":"48_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"48_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58821-1","volume-title":"Vorlesungen \u00fcber Informatik - Paralleles Rechnen und nicht-analytische L\u00f6sungsverfahren","author":"G. Goos","year":"1998","unstructured":"Goos, G.: Vorlesungen \u00fcber Informatik - Paralleles Rechnen und nicht-analytische L\u00f6sungsverfahren, vol.\u00a04. Springer, Berlin (1998)"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s007780050081","volume":"9","author":"J.R. Gruser","year":"2000","unstructured":"Gruser, J.R., Raschid, L., Zadorozhny, V., Zhan, T.: Learning response time for websources using query feedback and application in query optimization. VLDB Journal\u00a09, 18\u201337 (2000)","journal-title":"VLDB Journal"},{"key":"48_CR9","unstructured":"Nie, Z., Kambhampati, S.: A frequency-based approach for mining coverage statistics in data integration. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 387\u2013398 (2004)"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: Structure and value synopses for XML data graphs. In: Proc. of the Int. Conf. on Very Large Databases, VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50048-2"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access path selection in a relational database management system. In: Proce. of the ACM Int. Conf. on Management of Data (SIGMOD), Boston, MA, pp. 23\u201334 (1979)","DOI":"10.1145\/582095.582099"},{"key":"48_CR12","unstructured":"Stillger, M., Lohman, G.M., Markl, V., Kandil, M.: LEO - DB2\u2019s LEarning Optimizer. In: Proc. of the Int. Conf. on Very Large Databases (VLDB), Rome, Italy, pp. 19\u201328 (2001)"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/371578.371598","volume":"32","author":"D. Kossmann","year":"2000","unstructured":"Kossmann, D.: The state of the art in distributed query processing. ACM Computing Surveys\u00a032, 422\u2013469 (2000)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology - EDBT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11687238_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:24Z","timestamp":1619507844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11687238_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540329602","9783540329619"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11687238_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}