{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:51:08Z","timestamp":1767142268172,"version":"build-2238731810"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s11390-013-1391-8","type":"journal-article","created":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T00:46:44Z","timestamp":1384390004000},"page":"962-972","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for Supporting Tree-Like Indexes on the Chord Overlay"],"prefix":"10.1007","volume":"28","author":[{"given":"Ming-Dong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"De-Rong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kou","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tie-Zheng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,8]]},"reference":[{"key":"1391_CR1","unstructured":"Chang F, Dean J, Ghemawat S, Hsieh W C, Wallach D A, Burrows M, Chandra T, Fikes A, Gruber R E. Bigtable: A distributed storage system for structured data. In Proc. the 7th OSDI, November 2006, pp.205-218."},{"key":"1391_CR2","doi-asserted-by":"crossref","unstructured":"Cooper B F, Ramakrishnan R, Srivastava U, Silberstein A, Bohannon P, Jacobsen H, Puz N, Weaver D, Yerneni R. Pnuts: Yahoo!\u2019s hosted data serving platform. In Proc. the 34th VLDB, August 2008, pp.1277-1288.","DOI":"10.14778\/1454159.1454167"},{"key":"1391_CR3","doi-asserted-by":"crossref","unstructured":"DeCandia G, Hastorun D, Jampani M, Kakulapati G, Lakshman A, Pilchin A, Sivasubramanian S, Vosshall P, Vogels W. Dynamo: Amazons highly available key-value store. In Proc. the 21st SOSP, October 2007, pp.205-220.","DOI":"10.1145\/1323293.1294281"},{"key":"1391_CR4","unstructured":"Dean J, Ghemawat S. MapReduce: Simplified data processing on large clusters. In Proc. the 6th OSDI, December 2004, pp.137-150."},{"key":"1391_CR5","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. SIGCOMM, August 2001, pp.149-160.","DOI":"10.1145\/964723.383071"},{"key":"1391_CR6","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable contentaddressable network. In Proc. SIGCOMM, Aug. 2001, pp.161-172.","DOI":"10.1145\/964723.383072"},{"key":"1391_CR7","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP\/ACM International Conference on Distributed Systems Platforms, November 2001, pp.329-350.","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"2","key":"1391_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00778-005-0001-y","volume":"16","author":"E Tanin","year":"2007","unstructured":"Tanin E, Harwood A, Samet H. Using a distributed quadtree index in peer-to-peer networks. VLDB Journal, 2007, 16(2): 165\u2013178.","journal-title":"VLDB Journal"},{"key":"1391_CR9","doi-asserted-by":"crossref","unstructured":"Wang J, Wu S, Gao H, Li J, Ooi B C. Indexing multidimensional data in a cloud system. In Proc. SIGMOD, June 2010, pp.591-602.","DOI":"10.1145\/1807167.1807232"},{"key":"1391_CR10","doi-asserted-by":"crossref","unstructured":"Wu S, Jiang D, Ooi B C, Wu K L. Efficient B-tree based indexing for cloud data processing. In Proc. the 36th VLDB, September 2010, pp.1207-1218.","DOI":"10.14778\/1920841.1920991"},{"key":"1391_CR11","doi-asserted-by":"crossref","unstructured":"Chen G, Vo H, Wu S, Ooi B C, \u00d6zsu M T. A framework for supporting DBMS-like indexes in the cloud. In Proc. the 37th VLDB, August 2011, pp.702-713.","DOI":"10.14778\/3402707.3402711"},{"key":"1391_CR12","doi-asserted-by":"crossref","unstructured":"Crainiceanu A, Linga P, Machanavajjhala A et al. P-Ring: An efficient and robust P2P range index structure. In Proc. SIGMOD, June 2007, pp.223-234.","DOI":"10.1145\/1247480.1247507"},{"key":"1391_CR13","doi-asserted-by":"crossref","unstructured":"Zhu M, Shen D, Kou Y, Nie T, Yu G. An adaptive distributed index for similarity queries in metric spaces. In Proc. the 13th WAIM, August 2012, pp.222-227.","DOI":"10.1007\/978-3-642-32281-5_22"},{"key":"1391_CR14","doi-asserted-by":"crossref","unstructured":"Aberer K, Cudr\u00e9-Mauroux P, Datta A et al. P-Grid: A self-organizing structured P2P system. ACM SIGMOD Record, 32(3): 29\u201333.","DOI":"10.1145\/945721.945729"},{"key":"1391_CR15","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton F, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. the 29th STOC, 1997, pp.654-663.","DOI":"10.1145\/258533.258660"},{"key":"1391_CR16","doi-asserted-by":"crossref","unstructured":"Sexton A, Swinbank R. Bulk loading the M-tree to enhance query performance. In Proc. the 21st BNCOD, July 2004, pp.190-202.","DOI":"10.1007\/978-3-540-27811-5_18"},{"issue":"2","key":"1391_CR17","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., 2005, 30(2): 364\u2013397.","journal-title":"ACM Trans. Database Syst."},{"key":"1391_CR18","doi-asserted-by":"crossref","unstructured":"Novak D, Zezula P. M-Chord: A scalable distributed similarity search structure. In Proc. the 1st INFOSCALE, May 30-June 1, 2006, Article No. 19.","DOI":"10.1145\/1146847.1146866"},{"issue":"4","key":"1391_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D Novak","year":"2011","unstructured":"Novak D, Batko M, Zezula P. Metric index: An efficient and scalable solution for precise and approximate similarity search. Inf. Syst., 2011, 36(4): 721\u2013733.","journal-title":"Inf. Syst."},{"key":"1391_CR20","doi-asserted-by":"crossref","unstructured":"Batko M. Distributed and scalable similarity searching in metric spaces. In Proc. the 9th EDBT, March 2004, pp.44-153.","DOI":"10.1007\/978-3-540-30192-9_5"},{"issue":"9","key":"1391_CR21","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S Nene","year":"1997","unstructured":"Nene S, Nayar S. A simple algorithm for nearest neighbor search in high dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997, 19(9): 989\u20131003.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1391_CR22","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C. Voronoi-based k nearest neighbor search for spatial network database. In Proc. the 30th VLDB, August 31-Sept. 3, 2004, pp.840-851.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"1391_CR23","doi-asserted-by":"crossref","unstructured":"Mondal A, Lifu Y, Kitsuregawa M. P2PR-Tree: An R-tree-based spatial index for peer-to-peer environments. In Proc. the 9th EDBT, March 2004, pp.516-525.","DOI":"10.1007\/978-3-540-30192-9_51"}],"updated-by":[{"DOI":"10.1007\/s11390-013-1405-6","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T00:00:00Z","timestamp":1585267200000}}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1391-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-013-1391-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1391-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1391-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T18:50:45Z","timestamp":1596826245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-013-1391-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1391"],"URL":"https:\/\/doi.org\/10.1007\/s11390-013-1391-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}