{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:44:09Z","timestamp":1750239849889},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8-10","license":[{"start":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T00:00:00Z","timestamp":1340755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00607-012-0201-4","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T03:55:59Z","timestamp":1340769359000},"page":"783-809","source":"Crossref","is-referenced-by-count":2,"title":["Merging ring-structured overlay indices: toward network-data transparency"],"prefix":"10.1007","volume":"94","author":[{"given":"Anwitaman","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,27]]},"reference":[{"key":"201_CR1","unstructured":"Aberer K, Datta A, Hauswirth M, Schmidt R (2005) Indexing data-oriented overlay networks. In: International conference on very large databases (VLDB)"},{"key":"201_CR2","unstructured":"Bhagwan R, Tati K, Cheng Y, Savage S, Voelker, GM (2004) TotalRecall: system support for automated availability management. The ACM\/USENIX symposium on networked systems design and implementation"},{"key":"201_CR3","doi-asserted-by":"crossref","unstructured":"Bharambe A, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: ACM special interest group on data communication (SIGCOMM)","DOI":"10.1145\/1015467.1015507"},{"key":"201_CR4","doi-asserted-by":"crossref","unstructured":"Caesar M, Condie T, Kannan J, Lakshminarayanan K, Stoica I, Shenker S (2006): ROFL: routing on flat labels. In: ACM special interest group on data communication (SIGCOMM)","DOI":"10.1145\/1159913.1159955"},{"key":"201_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Narasayya V (1999) Index merging. In: International conference on data engineering (ICDE)","DOI":"10.1109\/ICDE.1999.754945"},{"key":"201_CR6","doi-asserted-by":"crossref","unstructured":"Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I (2001) Wide-area cooperative storage with CFS. In: ACM symposium on operating systems principles (SOSP)","DOI":"10.1145\/502034.502054"},{"key":"201_CR7","doi-asserted-by":"crossref","unstructured":"Datta A (2007) Merging intra-planetary index structures: decentralized bootstrapping of overlays. In: IEEE international conference on self-adaptive and self-organizing systems (SASO)","DOI":"10.1109\/SASO.2007.36"},{"key":"201_CR8","doi-asserted-by":"crossref","unstructured":"Datta A, Aberer K (2006) The challenges of merging two similar structured overlays: a tale of two networks. In: International workshop on self-organizing systems (IWSOS)","DOI":"10.1007\/11822035_3"},{"issue":"6","key":"201_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"G DeCandia","year":"2007","unstructured":"DeCandia G, Hastorun D, Jampani M, Kakulapati G, Lakshman A, Pilchin A, Sivasubramanian S, Vosshall P, Vogels W (2007) Dynamo: Amazon\u2019s highly available key\u2013value store. SIGOPS Oper Syst Rev 41(6): 205\u2013220","journal-title":"SIGOPS Oper Syst Rev"},{"key":"201_CR10","doi-asserted-by":"crossref","unstructured":"Falkner J, Piatek M, John JP, Krishnamurthy A, Anderson T (2007) Profiling a million user DHT. In: Australasian conference on Computer science (IMC)","DOI":"10.1145\/1298306.1298325"},{"key":"201_CR11","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: International conference on very large databases (VLDB)","DOI":"10.1016\/B978-012088469-8\/50041-3"},{"key":"201_CR12","unstructured":"Ganesan P, Gummadi P, Garcia-Molina H (2004) Canon in G Major: Designing DHTs with hierarchical structure. In: International conference on distributed computing systems (ICDCS)"},{"issue":"1","key":"201_CR13","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/1671948.1671950","volume":"5","author":"S Girdzijauskas","year":"2010","unstructured":"Girdzijauskas S, Datta A, Aberer K (2010) Structured overlay for heterogeneous environments: design and evaluation of Oscar. ACM Trans Auton Adapt Syst 5(1): 2:1\u20132:25","journal-title":"ACM Trans Auton Adapt Syst"},{"key":"201_CR14","doi-asserted-by":"crossref","unstructured":"Gummadi K, Gummadi R, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: ACM special interest group on data communication (SIGCOMM)","DOI":"10.1145\/863955.863998"},{"key":"201_CR15","unstructured":"Harvey N, Jones M, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In: USENIX symposium on internet technologies and systems (USITS)"},{"issue":"3","key":"201_CR16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/945721.945730","volume":"32","author":"JM Hellerstein","year":"2003","unstructured":"Hellerstein JM (2003) Toward network data independence. SIGMOD Rec 32(3): 34\u201340","journal-title":"SIGMOD Rec"},{"key":"201_CR17","doi-asserted-by":"crossref","unstructured":"Jelasity M, Montresor A, Babaoglu O (2006) The bootstrapping service. In: IEEE international conference on distributed computing systems workshops (ICDCSW)","DOI":"10.1109\/ICDCSW.2006.105"},{"key":"201_CR18","unstructured":"Joseph D, Kannan J, Kubota A, Lakshminarayanan K, Stoica I, Wehrle K (2006) OCALA: an architecture for supporting legacy applications over overlays. In: USENIX\/ACM symposium on networked systems design and implementation (NSDI)"},{"key":"201_CR19","doi-asserted-by":"crossref","unstructured":"Kis Z, Szabo R (2008) Chord-zip: A chord-ring merger algorithm. In: IEEE communications letters","DOI":"10.1109\/LCOMM.2008.080315"},{"issue":"4","key":"201_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1504\/IJCNDS.2010.033160","volume":"4","author":"Z Kis","year":"2010","unstructured":"Kis Z, Szabo R (2010) Scalable merger of chord-rings. Int J Commun Netw Distrib Syst 4(4): 376\u2013388","journal-title":"Int J Commun Netw Distrib Syst"},{"key":"201_CR21","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2000) he small-world phenomenon: An algorithmic perspective. In: ACM symposium on theory of computing","DOI":"10.1145\/335305.335325"},{"key":"201_CR22","doi-asserted-by":"crossref","unstructured":"Lakshman A, Malik P (2009) Cassandra\u2014a decentralized structured storage system. In: The 3rd ACM SIGOPS international workshop on large scale distributed systems and middleware (LADIS)","DOI":"10.1145\/1773912.1773922"},{"key":"201_CR23","unstructured":"Lester N, Zobel J, Williams H (2004) In-place versus re-build versus re-merge: index maintenance strategies for text retrieval systems. In: Australasian conference on Computer science (ACSC)"},{"key":"201_CR24","unstructured":"Li J, Stribling J, Morris R, Kaashoek M (2005) Bandwidth-efficient management of DHT routing tables. In: USENIX\/ACM symposium on networked systems design and implementation (NSDI)"},{"key":"201_CR25","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D, Balakrishnan H, Karger D (2002) Analysis of the evolution of peer-to-peer systems","DOI":"10.1145\/571825.571863"},{"key":"201_CR26","unstructured":"Manku G, Bawa M, Raghavan P (2003) Symphony: Distributed Hashing in a Small World. In: USENIX symposium on internet technologies and systems (USITS)"},{"key":"201_CR27","unstructured":"Montresor A, Jelasity M, Babaoglu O (2005) Chord on Demand. In: IEEE International conference on peer-to-peer computing (P2P)"},{"key":"201_CR28","doi-asserted-by":"crossref","unstructured":"Rhea S, Godfrey B, Karp B, Kubiatowicz J, Ratnasamy S, Shenker S, Stoica I, Yu H (2005) OpenDHT: A Public DHT Service and Its Uses. In: ACM special interest group on data communication (SIGCOMM)","DOI":"10.1145\/1080091.1080102"},{"key":"201_CR29","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP\/ACM international conference on distributed systems platforms (middleware)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"201_CR30","doi-asserted-by":"crossref","unstructured":"Shafaat T, Ghodsi A, Haridi S (2007) Handling network partitions and mergers in structured overlay networks. In: IEEE international conference on peer-to-peer computing (P2P)","DOI":"10.1109\/P2P.2007.42"},{"issue":"4","key":"201_CR31","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s12083-009-0037-7","volume":"2","author":"TM Shafaat","year":"2009","unstructured":"Shafaat TM, Ghodsi A, Haridi S (2009) Dealing with network partitions in structured overlay networks. Peer-to-Peer Netw Appl 2(4): 334\u2013347","journal-title":"Peer-to-Peer Netw Appl"},{"key":"201_CR32","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM special interest group on data communication (SIGCOMM) (technical report version, http:\/\/pdos.csail.mit.edu\/chord\/papers\/ )","DOI":"10.1145\/964723.383071"},{"key":"201_CR33","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement, IMC","DOI":"10.1145\/1177080.1177105"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0201-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0201-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0201-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T04:56:07Z","timestamp":1561870567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0201-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,27]]},"references-count":33,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0201-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,27]]}}}