{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:57:03Z","timestamp":1743145023660,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_48","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"498-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks"],"prefix":"10.1007","author":[{"given":"Quang Hieu","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Lupu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","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: ACM CIKM, pp. 304\u2013313 (2004)","DOI":"10.1145\/1031171.1031236"},{"key":"48_CR2","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)","DOI":"10.1145\/1060745.1060840"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: ACM SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"48_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"48_CR5","unstructured":"Blackard, J.A.: Covertype Data Set, Colorado State University (1998), http:\/\/archive.ics.uci.edu\/ml\/datasets\/Covertype"},{"issue":"3","key":"48_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Chavez","year":"2001","unstructured":"Chavez, E., Navarror, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: An overlay testbed for broad-coverage services. ACM SIGCOMM Computer Communication Review\u00a033(3) (2003)","DOI":"10.1145\/956993.956995"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"48_CR9","unstructured":"Doulkeridis, C., Vlachou, A., Kotidis, Y., Vazirgiannis, M.: Peer-to-peer similarity search in metric spaces. In: VLDB (2007)"},{"key":"48_CR10","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-addressable network for similarity search in metric spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol.\u00a04125, pp. 98\u2013110. Springer, Heidelberg (2007)"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"issue":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems (TODS)\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"2","key":"48_CR13","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive B\u2009+\u2009-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS)\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"48_CR14","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H.: BATON: A balanced tree structure for Peer-to-Peer networks. In: VLDB (2005)"},{"key":"48_CR15","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 (2006)","DOI":"10.1109\/ICDE.2006.169"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Karger, D., Kaashoek, F., Stoica, I., Morris, R., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/964723.383071"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Li, M., Lee, W.-C., Sivasubramaniam, A.: DPTree: A balanced tree based indexing framework for peer-to-peer systems. In: ICNP (2006)","DOI":"10.1109\/ICNP.2006.320194"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Novak, D., Zezula, P.: M-chord: a scalable distributed similarity search structure. In: InfoScale (2006)","DOI":"10.1145\/1146847.1146866"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.-L., Yu, C., Bressan, S.: Indexing the edges: a simple and yet efficient approach to high-dimensional indexing. In: ACM PODS (2000)","DOI":"10.1145\/335168.335219"},{"key":"48_CR20","unstructured":"Ortega-Binderberger, M.: Image features extracted from a Corel image collection (1999), http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.data.html"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"48_CR22","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R\u2009+\u2009-tree: A dynamic index for multi-dimensional objects. In: VLDB, pp. 507\u2013518 (1987)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T12:14:23Z","timestamp":1685103263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}