{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T07:49:53Z","timestamp":1792741793431,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,20]]},"DOI":"10.1145\/2237867.2237869","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Towards benefit-based RDF source selection for SPARQL queries"],"prefix":"10.1145","author":[{"given":"Katja","family":"Hose","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"Schenkel","sequence":"additional","affiliation":[{"name":"Saarland University and MPI Informatics, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"LDOW","author":"Alexander K.","year":"2009","unstructured":"K. Alexander , R. Cyganiak , M. Hausenblas , and J. Zhao . Describing Linked Datasets---On the Design and Usage of voiD, the Vocabulary of Interlinked Datasets . In LDOW , 2009 . K. Alexander, R. Cyganiak, M. Hausenblas, and J. Zhao. Describing Linked Datasets---On the Design and Usage of voiD, the Vocabulary of Interlinked Datasets. In LDOW, 2009."},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"ESWC (2)","author":"Aranda C. B.","year":"2011","unstructured":"C. B. Aranda , M. Arenas , and \u00d3. Corcho. Semantics and optimization of the SPARQL 1.1 federation extension . In ESWC (2) , pages 1 -- 15 , 2011 . C. B. Aranda, M. Arenas, and \u00d3. Corcho. Semantics and optimization of the SPARQL 1.1 federation extension. In ESWC (2), pages 1--15, 2011."},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Reasoning Web","author":"Auer S.","year":"2011","unstructured":"S. Auer , J. Lehmann , and A.-D. N. Ngomo . Introduction to linked data and its lifecycle on the Web . In Reasoning Web , pages 1 -- 75 . 2011 . S. Auer, J. Lehmann, and A.-D. N. Ngomo. Introduction to linked data and its lifecycle on the Web. In Reasoning Web, pages 1--75. 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963440"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"RANDOM","author":"Bar-Yossef Z.","year":"2002","unstructured":"Z. Bar-Yossef , T. S. Jayram , R. Kumar , D. Sivakumar , and L. Trevisan . Counting distinct elements in a data stream . In RANDOM , pages 1 -- 10 , 2002 . Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, pages 1--10, 2002."},{"key":"e_1_3_2_1_6_1","volume-title":"SSWS","author":"Basca C.","year":"2010","unstructured":"C. Basca and A. Bernstein . Avalanche: Putting the Spirit of the Web back into Semantic Web Querying . In SSWS , 2010 . C. Basca and A. Bernstein. Avalanche: Putting the Spirit of the Web back into Semantic Web Querying. In SSWS, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076049"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562787"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4018\/jswis.2009081901"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215328"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_15_1","first-page":"109","volume-title":"Federated Data Management and Query Optimization for Linked Open Data","author":"G\u00f6rlitz O.","year":"2011","unstructured":"O. G\u00f6rlitz and S. Staab . Federated Data Management and Query Optimization for Linked Open Data , chapter 5, pages 109 -- 137 . Springer , 2011 . O. G\u00f6rlitz and S. Staab. Federated Data Management and Query Optimization for Linked Open Data, chapter 5, pages 109--137. Springer, 2011."},{"key":"e_1_3_2_1_16_1","volume-title":"COLD","author":"G\u00f6rlitz O.","year":"2011","unstructured":"O. G\u00f6rlitz and S. Staab . SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions . In COLD , 2011 . O. G\u00f6rlitz and S. Staab. SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions. In COLD, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191869"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772733"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-010-0021-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062902"},{"key":"e_1_3_2_1_21_1","first-page":"94","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D. S.","year":"1997","unstructured":"D. S. Hochbaum . Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems . In Approximation algorithms for NP-hard problems , pages 94 -- 143 . 1997 . D. S. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In Approximation algorithms for NP-hard problems, pages 94--143. 1997."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2009.25"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789394.1789441"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978566"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789394.1789442"},{"key":"e_1_3_2_1_26_1","first-page":"425","volume-title":"DEXA (1)","author":"Nguyen K.","year":"2011","unstructured":"K. Nguyen and J. Cao . K-Graphs: Selecting top-k data sources for XMI keyword queries . In DEXA (1) , pages 425 -- 439 , 2011 . K. Nguyen and J. Cao. K-Graphs: Selecting top-k data sources for XMI keyword queries. In DEXA (1), pages 425--439, 2011."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-010-7067-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789394.1789443"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2063016.2063055"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277827"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860490"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988758"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03079-6_5"},{"key":"e_1_3_2_1_34_1","first-page":"171","volume-title":"DEXA (2)","author":"Tran T.","year":"2011","unstructured":"T. Tran , G. Ladwig , and A. Wagner . Approximate and incremental processing of complex queries against the web of data . In DEXA (2) , pages 171 -- 187 , 2011 . T. Tran, G. Ladwig, and A. Wagner. Approximate and incremental processing of complex queries against the web of data. In DEXA (2), pages 171--187, 2011."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-010-0107-z"},{"key":"e_1_3_2_1_36_1","first-page":"240","volume-title":"VLDB","author":"Wang W.","year":"2004","unstructured":"W. Wang , H. Jiang , H. Lu , and J. X. Yu . Bloom histogram: Path selectivity estimation for XML data with updates . In VLDB , pages 240 -- 251 , 2004 . W. Wang, H. Jiang, H. Lu, and J. X. Yu. Bloom histogram: Path selectivity estimation for XML data with updates. In VLDB, pages 240--251, 2004."}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","location":"Scottsdale Arizona","acronym":"SIGMOD\/PODS '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 4th International Workshop on Semantic Web Information Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2237867.2237869","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2237867.2237869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:54Z","timestamp":1750276854000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2237867.2237869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":36,"alternative-id":["10.1145\/2237867.2237869","10.1145\/2237867"],"URL":"https:\/\/doi.org\/10.1145\/2237867.2237869","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}