{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:34:53Z","timestamp":1743014093562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319968896"},{"type":"electronic","value":"9783319968902"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96890-2_20","type":"book-chapter","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T05:27:37Z","timestamp":1531978057000},"page":"236-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributed k-Nearest Neighbor Queries in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Xin","family":"Ding","sequence":"first","affiliation":[]},{"given":"Yuanliang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-31838-5_6","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"M Batko","year":"2005","unstructured":"Batko, M., Gennaro, C., Zezula, P.: A scalable nearest neighbor search in P2P systems. In: Ng, W.S., Ooi, B.-C., Ouksel, Aris M., Sartori, C. (eds.) DBISP2P 2004. LNCS, vol. 3367, pp. 79\u201392. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31838-5_6"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11549819_3","volume-title":"Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures","author":"M Batko","year":"2005","unstructured":"Batko, M., Gennaro, C., Zezula, P.: Similarity grid for searching in metric spaces. In: T\u00fcrker, C., Agosti, M., Schek, H.-J. (eds.) Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures. LNCS, vol. 3664, pp. 25\u201344. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549819_3"},{"issue":"8","key":"20_CR3","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.future.2007.07.012","volume":"24","author":"M Batko","year":"2008","unstructured":"Batko, M., Novak, D., Falchi, F., Zezula, P.: Scalability comparison of peer-to-peer similarity search structures. Future Gener. Comput. Syst. 24(8), 834\u2013848 (2008)","journal-title":"Future Gener. Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Batko, M., Novak, D., Falchi, F., Zezula, P.: On scalability of the similarity search in the world of peers. In: INFOSCALE, p. 20 (2006)","key":"20_CR4","DOI":"10.1145\/1146847.1146867"},{"doi-asserted-by":"crossref","unstructured":"Dohnal, V., Sedmidubsky, J., Zezula, P., Novak, D.: Similarity searching: towards bulk-loading peer-to-peer networks. In: SISAP, pp. 87\u201394 (2008)","key":"20_CR5","DOI":"10.1109\/SISAP.2008.9"},{"unstructured":"Doulkeridis, C., Vlachou, A., Kotidis, Y., Vazirgiannis, M.: Peer-to-peer similarity search in metric spaces. In: VLDB, pp. 986\u2013997 (2007)","key":"20_CR6"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina Jr","year":"2007","unstructured":"Traina Jr., C., Filho, R.F.S., Traina, A.J.M., Vieira, M.R., Faloutsos, C.: The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4), 483\u2013505 (2007)","journal-title":"VLDB J."},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ipm.2010.12.004","volume":"48","author":"D Novak","year":"2012","unstructured":"Novak, D., Batko, M., Zezula, P.: Large-scale similarity data management with distributed metric index. Inf. Process. Manag. 48(5), 855\u2013872 (2012)","journal-title":"Inf. Process. Manag."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"Ion Stoica","year":"2001","unstructured":"Stoica, I., Morris, R.T., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, pp. 149\u2013160 (2001)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-28148-8_2","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems V","author":"A Vlachou","year":"2012","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y.: Metric-based similarity search in unstructured peer-to-peer systems. In: Hameurlain, A., K\u00fcng, J., Wagner, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems V. LNCS, vol. 7100, pp. 28\u201348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28148-8_2"},{"doi-asserted-by":"crossref","unstructured":"Ares, L.G., Brisaboa, N.R., Esteller, M.F., Pedreira, O., Places, A.S.: Optimal pivots to minimize the index size for metric access methods. In: SISAP, pp. 74\u201380 (2009)","key":"20_CR11","DOI":"10.1109\/SISAP.2009.21"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"Norbert Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","journal-title":"ACM SIGMOD Record"},{"issue":"7","key":"20_CR13","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/TKDE.2004.1318564","volume":"16","author":"HT Shen","year":"2004","unstructured":"Shen, H.T., Shu, Y., Yu, B.: Efficient semantic-based content search in P2P network. IEEE Trans. Knowl. Data Eng. 16(7), 813\u2013826 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/964723.383072","volume":"31","author":"Sylvia Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161\u2013172 (2001)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660 (2005)","key":"20_CR15","DOI":"10.1145\/1060745.1060840"},{"doi-asserted-by":"crossref","unstructured":"Banaei-Kashani, F., Shahabi, C.: SWAM: a family of access methods for similarity-search in peer-to-peer data networks. In: CIKM, pp. 304\u2013313 (2004)","key":"20_CR16","DOI":"10.1145\/1031171.1031236"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/JSAC.2007.070104","volume":"25","author":"C Doulkeridis","year":"2007","unstructured":"Doulkeridis, C., N\u00f8rv\u00e5g, K., Vazirgiannis, M.: DESENT: decentralized and distributed semantic overlay generation in P2P networks. IEEE J. Sel. Areas Commun. 25(1), 25\u201334 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"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: ICDE, p. 34 (2006)","key":"20_CR18","DOI":"10.1109\/ICDE.2006.169"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/1030194.1015507","volume":"34","author":"Ashwin R. Bharambe","year":"2004","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp. 353\u2013366 (2004)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"unstructured":"Liu, B., Lee, W., Lee, D.L.: Supporting complex multi-dimensional queries in P2P systems. In: ICDCS, pp. 155\u2013164 (2005)","key":"20_CR20"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.is.2004.09.003","volume":"31","author":"P Kalnis","year":"2006","unstructured":"Kalnis, P., Ng, W.S., Ooi, B.C., Tan, K.: Answering similarity queries in peer-to-peer networks. Inf. Syst. 31(1), 57\u201372 (2006)","journal-title":"Inf. Syst."},{"issue":"6","key":"20_CR22","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s12083-014-0304-0","volume":"8","author":"SM Ghanem","year":"2015","unstructured":"Ghanem, S.M., Ismail, M.A., Omar, S.G.: VITAL: structured and clustered super-peer network for similarity search. Peer-to-Peer Netw. Appl. 8(6), 965\u2013991 (2015)","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-71661-7_9","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"F Falchi","year":"2007","unstructured":"Falchi, F., Gennaro, C., Zezula, P.: A content\u2013addressable network for similarity search in metric spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, Aris M. (eds.) DBISP2P 2005-2006. LNCS, vol. 4125, pp. 98\u2013110. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71661-7_9"},{"doi-asserted-by":"crossref","unstructured":"Novak, D., Zezula, P.: M-Chord: a scalable distributed similarity search structure. In: INFOSCALE, p. 19 (2006)","key":"20_CR24","DOI":"10.1145\/1146847.1146866"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K., Yu, C., Zhang, R.: iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R.A., Marroquin, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77088-6_1","volume-title":"Digital Libraries: Research and Development","author":"M Batko","year":"2007","unstructured":"Batko, M., Novak, D., Zezula, P.: MESSIF: metric similarity search implementation framework. In: Thanos, C., Borri, F., Candela, L. (eds.) DELOS 2007. LNCS, vol. 4877, pp. 1\u201310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77088-6_1"},{"key":"20_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32653-7","volume-title":"Distributed Event-Based Systems","author":"G M\u00fchl","year":"2006","unstructured":"M\u00fchl, G., Fiege, L., Pietzuch, P.R.: Distributed Event-Based Systems. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-32653-7"},{"key":"20_CR29","series-title":"International Computer Science Series","volume-title":"Distributed Systems - Concepts and Designs","author":"G Coulouris","year":"2002","unstructured":"Coulouris, G., Dollimore, J., Kindberg, T.: Distributed Systems - Concepts and Designs. International Computer Science Series, 3rd edn. Addison-Wesley-Longman, Boston (2002)","edition":"3"},{"issue":"14","key":"20_CR30","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit. Lett. 24(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognit. Lett."},{"unstructured":"Yu, C., Ooi, B.C., Tan, K., Jagadish, H.V.: Indexing the distance: an efficient method to KNN processing. In: VLDB, pp. 421\u2013430 (2001)","key":"20_CR31"},{"doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Li, X., Jensen, C.S., Chen, G.: Efficient metric indexing for similarity search. In: ICDE, pp. 591\u2013602 (2015)","key":"20_CR32","DOI":"10.1109\/ICDE.2015.7113317"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96890-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:26:38Z","timestamp":1710246398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96890-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968896","9783319968902"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96890-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"19 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.cis.umac.mo\/apwebwaim2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}