{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:53:27Z","timestamp":1743029607922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458793"},{"type":"electronic","value":"9783319458809"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-45880-9_20","type":"book-chapter","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T09:21:31Z","timestamp":1473240091000},"page":"257-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nearest Query on Distributed Binary Trees Starting from a Random Node"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Gargiulo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flora","family":"Amato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Picariello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giancarlo","family":"Sperli\u2019","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Pedersen, T., Patwardhan, S., Michelizzi, J.: WordNet: similarity: measuring the relatedness of concepts. In: Demonstration Papers at HLT-NAACL 2004, pp. 38\u201341. Association for Computational Linguistics, May 2004","key":"20_CR1","DOI":"10.3115\/1614025.1614037"},{"key":"20_CR2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036121","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2000","unstructured":"Cox, T.F., Cox, M.A.: Multidimensional Scaling. CRC Press, Boca Raton (2000)"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/568271.223812","volume":"24","author":"C Faloutsos","year":"1995","unstructured":"Faloutsos, C., Lin, K.I.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. ACM SIGMOD Rec. 24(2), 163\u2013174 (1995)","journal-title":"ACM SIGMOD Rec."},{"key":"20_CR4","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"},{"doi-asserted-by":"crossref","unstructured":"Silaghi, B., Bhattacharjee, S., Keleher, P.J.: Query routing in the TerraDir distributed directory. In: ITCom 2002: The Convergence of Information Technologies and Communications, pp. 299\u2013309. International Society for Optics and Photonics, July 2002","key":"20_CR5","DOI":"10.1117\/12.475281"},{"unstructured":"Aly, M., Munich, M., Perona, P.: Distributed kd-trees for retrieval from very large image collections. In: Proceedings of the British Machine Vision Conference (BMVC), August 2011","key":"20_CR6"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: Vbi-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: 2006 Proceedings of the 22nd International Conference on Data Engineering ICDE 2006, pp. 34\u201334. IEEE, April 2006","key":"20_CR8","DOI":"10.1109\/ICDE.2006.169"},{"unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: a balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 661\u2013672. VLDB Endowment, August 2005","key":"20_CR9"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Commun. ACM 46(2), 43\u201348 (2003)","journal-title":"Commun. ACM"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"BY Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41\u201353 (2004)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/964723.383072","volume":"31","author":"S Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. ACM SIGCOMM Comput. Commun. Rev. 31(4), 161\u2013172 (2001)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"MF Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: a simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 98\u2013107. Springer, Heidelberg (2003)"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s002240000118","volume":"32","author":"CG Plaxton","year":"1999","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theor. Comput. Syst. 32(3), 241\u2013280 (1999)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10707-012-0163-x","volume":"17","author":"G Tsatsanifos","year":"2013","unstructured":"Tsatsanifos, G., Sacharidis, D., Sellis, T.: Index-based query processing on distributed multidimensional data. GeoInformatica 17(3), 489\u2013519 (2013)","journal-title":"GeoInformatica"}],"container-title":["Communications in Computer and Information Science","Knowledge Engineering and Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45880-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:19:53Z","timestamp":1558394393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45880-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458793","9783319458809"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45880-9_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KESW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Engineering and the Semantic Web","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"kesw2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}