{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:28:33Z","timestamp":1742988513700,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642177453"},{"type":"electronic","value":"9783642177460"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17746-0_49","type":"book-chapter","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T04:05:44Z","timestamp":1291781144000},"page":"781-797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Summary Models for Routing Keywords to Linked Data Sources"],"prefix":"10.1007","author":[{"given":"Thanh","family":"Tran","sequence":"first","affiliation":[]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Rudi","family":"Studer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Harth, A., Hogan, A., Delbru, R., Umbrich, J., O\u2019Riain, S., Decker, S.: Swse: Answers before links! In: Semantic Web Challenge (2007)","key":"49_CR1"},{"doi-asserted-by":"crossref","unstructured":"Harth, A., Hose, K., Karnstedt, M., Polleres, A., Sattler, K.-U., Umbrich, J.: Data summaries for on-demand queries over linked data. In: WWW, pp. 411\u2013420 (2010)","key":"49_CR2","DOI":"10.1145\/1772690.1772733"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-76298-0_16","volume-title":"The Semantic Web","author":"A. Harth","year":"2007","unstructured":"Harth, A., Umbrich, J., Hogan, A., Decker, S.: Yars2: A federated repository for querying graph structured data from the web. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudr\u00e9-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol.\u00a04825, pp. 211\u2013224. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Liu, F., Yu, C.T., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD Conference, pp. 563\u2013574 (2006)","key":"49_CR4","DOI":"10.1145\/1142473.1142536"},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T. Neumann","year":"2010","unstructured":"Neumann, T., Weikum, G.: The rdf-3x engine for scalable management of rdf data. VLDB J.\u00a019(1), 91\u2013113 (2010)","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Sayyadian, M., LeKhac, H., Doan, A., Gravano, L.: Efficient keyword search across heterogeneous relational databases. In: ICDE, pp. 346\u2013355 (2007)","key":"49_CR6","DOI":"10.1109\/ICDE.2007.367880"},{"doi-asserted-by":"crossref","unstructured":"Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. In: ICDE, pp. 405\u2013416 (2009)","key":"49_CR7","DOI":"10.1109\/ICDE.2009.119"},{"unstructured":"Tran, T., Zhang, L.: Keyword query routing. Technical report, Karlsruhe Institute of Technology (2010), \n                      http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/dtr\/papers\/kqueryrouting.pdf","key":"49_CR8"},{"doi-asserted-by":"crossref","unstructured":"Tummarello, G., Cyganiak, R., Catasta, M., Danielczyk, S., Delbru, R., Decker, S.: Sig.ma: live views on the web of data. In: WWW, pp. 1301\u20131304 (2010)","key":"49_CR9","DOI":"10.2139\/ssrn.3199488"},{"doi-asserted-by":"crossref","unstructured":"Vu, Q.H., Ooi, B.C., Papadias, D., Tung, A.K.H.: A graph method for keyword-based selection of the top-k databases. In: SIGMOD Conference, pp. 915\u2013926 (2008)","key":"49_CR10","DOI":"10.1145\/1376616.1376707"},{"doi-asserted-by":"crossref","unstructured":"Yu, B., Li, G., Sollins, K.R., Tung, A.K.H.: Effective keyword-based selection of relational databases. In: SIGMOD Conference, pp. 139\u2013150 (2007)","key":"49_CR11","DOI":"10.1145\/1247480.1247498"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17746-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T01:08:56Z","timestamp":1662772136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-17746-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642177453","9783642177460"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17746-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}