{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T18:14:40Z","timestamp":1770574480362,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"vor","delay-in-days":27,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s41019-019-0095-7","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T02:02:55Z","timestamp":1561687375000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Distributed Similarity Queries in Metric Spaces"],"prefix":"10.1007","volume":"4","author":[{"given":"Keyu","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xin","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Yuanliang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,28]]},"reference":[{"issue":"4","key":"95_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s41019-017-0043-3","volume":"2","author":"G Vargas-Solar","year":"2017","unstructured":"Vargas-Solar G, Zechinelli-Martini J, Espinosa-Oviedo J (2017) Big data management: what to keep from the past to face future challenges? Data Sci Eng 2(4):328\u2013345","journal-title":"Data Sci Eng"},{"issue":"4","key":"95_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s41019-017-0053-1","volume":"2","author":"B Chen","year":"2017","unstructured":"Chen B, Lv Z, Yu X, Liu Y (2017) Sliding window top-k monitoring over distributed data streams. Data Sci Eng 2(4):289\u2013300","journal-title":"Data Sci Eng"},{"issue":"2","key":"95_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s41019-017-0040-6","volume":"2","author":"Z Zhao","year":"2017","unstructured":"Zhao Z, Liu T, Li S, Li B, Du X (2017) Guiding the training of distributed text representation with supervised weighting scheme for sentiment analysis. Data Sci Eng 2(2):178\u2013186","journal-title":"Data Sci Eng"},{"issue":"1","key":"95_CR4","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka M, Fujimori T, Shiokawa H (2017) Graph partitioning for distributed graph processing. Data Sci Eng 2(1):94\u2013105","journal-title":"Data Sci Eng"},{"issue":"1","key":"95_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s41019-016-0023-z","volume":"2","author":"X Zhang","year":"2017","unstructured":"Zhang X, Chen L (2017) Distance-aware selective online query processing over large distributed graphs. Data Sci Eng 2(1):2\u201321","journal-title":"Data Sci Eng"},{"key":"95_CR6","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":"Michal Batko","year":"2005","unstructured":"Batko M, Gennaro C, Zezula P (2005) A scalable nearest neighbor search in p2p systems. In: DBISP2P, pp 79\u201392"},{"key":"95_CR7","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":"Michal Batko","year":"2005","unstructured":"Batko M, Gennaro C, Zezula P (2005) Similarity grid for searching in metric spaces. In: Peer-To-peer, grid, and service-orientation in digital library architectures, pp 25\u201344"},{"issue":"8","key":"95_CR8","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 (2008) Scalability comparison of peer-to-peer similarity search structures. Future Gener Comput Syst 24(8):834\u2013848","journal-title":"Future Gener Comput Syst"},{"key":"95_CR9","doi-asserted-by":"crossref","unstructured":"Batko M, Novak D, Falchi F, Zezula P (2006) On scalability of the similarity search in the world of peers. In: International conference on scalable information systems, p 20","DOI":"10.1145\/1146847.1146867"},{"key":"95_CR10","doi-asserted-by":"crossref","unstructured":"Crainiceanu A, Linga P, Gehrke J, Shanmugasundaram J (2004) P-tree: a p2p index for resource discovery applications. In: IEEE international conference on sensor networks, pp 390\u2013391","DOI":"10.1145\/1013367.1013490"},{"key":"95_CR11","unstructured":"Dohnal V, Sedmidubsk\u00fd J, Zezula P, Nov\u00e1k D (2008) Similarity searching: towards bulk-loading peer-to-peer networks. In: International workshop on similarity search and applications, pp 87\u201394"},{"issue":"1","key":"95_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/JSAC.2007.070104","volume":"25","author":"C Doulkeridis","year":"2007","unstructured":"Doulkeridis C, Norvag K, Vazirgiannis M (2007) Desent: decentralized and distributed semantic overlay generation in p2p networks. IEEE J Sel Areas Commun 25(1):25\u201334","journal-title":"IEEE J Sel Areas Commun"},{"issue":"4","key":"95_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"RF Filho","year":"2007","unstructured":"Filho RF, Traina AJ, Vieira MR, Faloutsos C (2007) 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","journal-title":"VLDB J"},{"key":"95_CR14","volume-title":"Distributed event-based systems","author":"G M\u00fchl","year":"2006","unstructured":"M\u00fchl G, Fiege L, Pietzuch P (2006) Distributed event-based systems. Springer, Berlin"},{"issue":"5","key":"95_CR15","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 (2012) Large-scale similarity data management with distributed metric index. Inf Process Manage 48(5):855\u2013872","journal-title":"Inf Process Manage"},{"issue":"4","key":"95_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput Commun Rev 31(4):149\u2013160","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"95_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-28148-8_2","volume":"5","author":"A Vlachou","year":"2012","unstructured":"Vlachou A, Doulkeridis C, Kotidis Y (2012) Metric-based similarity search in unstructured peer-to-peer systems. Trans Large Scale Data Knowl Cent Syst V 5:28\u201348","journal-title":"Trans Large Scale Data Knowl Cent Syst V"},{"key":"95_CR18","doi-asserted-by":"crossref","unstructured":"Ares LG, Brisaboa NR, Esteller MF, Pedreira O, Places \u00c1ngeles S (2009) Optimal pivots to minimize the index size for metric access methods. In: International workshop on similarity search and applications, pp 74\u201380","DOI":"10.1109\/SISAP.2009.21"},{"key":"95_CR19","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R$$^\\star $$-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp 322\u2013331","DOI":"10.1145\/93605.98741"},{"issue":"7","key":"95_CR20","first-page":"813","volume":"16","author":"HT Shen","year":"2004","unstructured":"Shen HT, Shu Y, Yu B (2004) Efficient semantic-based content search in p2p network. TKDE 16(7):813\u2013826","journal-title":"TKDE"},{"key":"95_CR21","doi-asserted-by":"crossref","unstructured":"Ding X, Zhang Y, Chen L, Gao Y, Zheng B (2018) Distributed k-nearest neighbor queries in metric spaces. In: APWeb-WAIM, pp 236\u2013252","DOI":"10.1007\/978-3-319-96890-2_20"},{"key":"95_CR22","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp RM, Shenker S (2001) A scalable content-addressable network. In: SIGCOMM, pp 161\u2013172","DOI":"10.1145\/964723.383072"},{"key":"95_CR23","doi-asserted-by":"crossref","unstructured":"Bawa M, Condie T, Ganesan P (2005) Lsh forest: self-tuning indexes for similarity search. In: International conference on world wide web, pp 651\u2013660","DOI":"10.1145\/1060745.1060840"},{"key":"95_CR24","doi-asserted-by":"crossref","unstructured":"Banaei-Kashani F, Shahabi C (2004) Swam: A family of access methods for similarity-search in peer-to-peer data networks. In: ACM international conference on information and knowledge management, pp 304\u2013313","DOI":"10.1145\/1031171.1031236"},{"issue":"2","key":"95_CR25","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"EK Lua","year":"2005","unstructured":"Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun Surv Tutor 7(2):72\u201393","journal-title":"IEEE Commun Surv Tutor"},{"key":"95_CR26","unstructured":"Jagadish HV, Ooi BC, Vu QH (2005) Baton: a balanced tree structure for peer-to-peer networks. In: VLDB, pp 661\u2013672"},{"key":"95_CR27","doi-asserted-by":"crossref","unstructured":"Jagadish HV, Ooi BC, Vu QH, Zhang R (2006) Vbi-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: ICDE, pp 34\u201334","DOI":"10.1109\/ICDE.2006.169"},{"issue":"4","key":"95_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/1030194.1015507","volume":"34","author":"AR Bharambe","year":"2004","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. ACM SIGCOMM Comput Commun Rev 34(4):353\u2013366","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"95_CR29","unstructured":"Liu B, Lee WC, Lee DL (2005) Supporting complex multi-dimensional queries in p2p systems. In: IEEE international conference on distributed computing systems, pp 155\u2013164"},{"key":"95_CR30","first-page":"173","volume":"P2P","author":"Y Shu","year":"2005","unstructured":"Shu Y, Ooi BC, Tan KL, Zhou A (2005) Supporting multi-dimensional range queries in peer-to-peer systems. IEEE P2P:173\u2013180","journal-title":"IEEE"},{"key":"95_CR31","doi-asserted-by":"crossref","unstructured":"Ganesan P, Bawa M, Garcia-Molina H (2004) Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB, pp 444\u2013455","DOI":"10.1016\/B978-012088469-8.50041-3"},{"issue":"4","key":"95_CR32","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1290672.1290674","volume":"3","author":"J Aspnes","year":"2003","unstructured":"Aspnes J, Shah G (2003) Skip graphs. ACM Trans Algorithm 3(4):37","journal-title":"ACM Trans Algorithm"},{"key":"95_CR33","doi-asserted-by":"crossref","unstructured":"Ntarmos N, Pitoura T, Triantafillou P (2007) Range query optimization leveraging peer heterogeneity in DHT data networks. In: Databases, information systems, and peer-to-peer computing, pp 111\u2013122","DOI":"10.1007\/978-3-540-71661-7_10"},{"key":"95_CR34","doi-asserted-by":"crossref","unstructured":"Crainiceanu A, Linga P, Machanavajjhala A, Gehrke J, Shanmugasundaram J (2007) P-ring: an efficient and robust p2p range index structure. In: SIGMOD, pp 223\u2013234","DOI":"10.1145\/1247480.1247507"},{"issue":"1","key":"95_CR35","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 WS, Ooi BC, Tan K-L (2006) Answering similarity queries in peer-to-peer networks. Inf Syst 31(1):57\u201372","journal-title":"Inf Syst"},{"key":"95_CR36","doi-asserted-by":"crossref","unstructured":"Datta A, Hauswirth M, John R, Schmidt R, Aberer K (2005) Range queries in trie-structured overlays. In: IEEE international conference on peer-to-peer computing, pp 57\u201366","DOI":"10.1109\/P2P.2005.31"},{"issue":"6","key":"95_CR37","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s12083-014-0304-0","volume":"8","author":"SM Ghanem","year":"2015","unstructured":"Ghanem SM, Ismail MA, Omar SG (2015) Vital: structured and clustered super-peer network for similarity search. Peer-to-Peer Netw Appl 8(6):965\u2013991","journal-title":"Peer-to-Peer Netw Appl"},{"key":"95_CR38","doi-asserted-by":"crossref","unstructured":"Falchi F, Gennaro C, Zezula P (2007) A content\u2013addressable network for similarity search in metric spaces. In: DBISP2P, pp 98\u2013110","DOI":"10.1007\/978-3-540-71661-7_9"},{"key":"95_CR39","doi-asserted-by":"crossref","unstructured":"Novak D, Zezula P (2006) M-chord: a scalable distributed similarity search structure. In: International conference on scalable information systems, p 19","DOI":"10.1145\/1146847.1146866"},{"issue":"2","key":"95_CR40","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) idistance: an adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364\u2013397","journal-title":"ACM Trans Database Syst"},{"key":"95_CR41","unstructured":"Doulkeridis C, Vlachou A, Kotidis Y, Vazirgiannis M (2007) Peer-to-peer similarity search in metric spaces. In: VLDB, pp 986\u2013997"},{"issue":"2\u20133","key":"95_CR42","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10619-009-7047-6","volume":"26","author":"C Doulkeridis","year":"2009","unstructured":"Doulkeridis C, Vlachou A, Kotidis Y, Vazirgiannis M (2009) Efficient range query processing in metric spaces over highly distributed data. Distrib Parallel Databases 26(2\u20133):155\u2013180","journal-title":"Distrib Parallel Databases"},{"issue":"3","key":"95_CR43","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 (2001) Searching in metric spaces. ACM Comput Surv 33(3):273\u2013321","journal-title":"ACM Comput Surv"},{"key":"95_CR44","doi-asserted-by":"crossref","unstructured":"Batko M, Novak D, Zezula P (2007) Messif: metric similarity search implementation framework. In: Digital libraries: research and development, pp 1\u201310","DOI":"10.1007\/978-3-540-77088-6_1"},{"key":"95_CR45","volume-title":"Distributed systems: concepts and design","author":"GF Coulouris","year":"2005","unstructured":"Coulouris GF, Dollimore J, Kindberg T (2005) Distributed systems: concepts and design. Pearson Education, London"},{"issue":"14","key":"95_CR46","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 (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn Lett 24(14):2357\u20132366","journal-title":"Pattern Recogn Lett"},{"key":"95_CR47","unstructured":"Yu C, Ooi BC, Tan KL, Jagadish HV (2001) Indexing the distance: an efficient method to knn processing. In: VLDB, pp 421\u2013430"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-0095-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-019-0095-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-0095-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T08:59:54Z","timestamp":1610096394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-019-0095-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s41019-019-0095-7","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"3 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}