{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:48:47Z","timestamp":1794336527695,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540290681","type":"print"},{"value":"9783540319061","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558989_5","type":"book-chapter","created":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T03:51:51Z","timestamp":1130903511000},"page":"47-57","source":"Crossref","is-referenced-by-count":30,"title":["Brushwood: Distributed Trees in Peer-to-Peer Systems"],"prefix":"10.1007","author":[{"given":"Chi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arvind","family":"Krishnamurthy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Randolph Y.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Second IEEE International Conference on Peer-to-Peer Computing (2002)","DOI":"10.1109\/PTP.2002.1046310"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancking and locality in range-queriable data structures. In: Proc. of PODC (2004)","DOI":"10.1145\/1011767.1011785"},{"key":"5_CR3","unstructured":"Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of Symposium on Discrete Algorithms (2003)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Peer-to-peer systems for Prefix Search. In: PODC (2003)","DOI":"10.1145\/872035.872053"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM\u00a018(9) (1975)","DOI":"10.1145\/361002.361007"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: SIGCOMM (2004)","DOI":"10.1145\/1015467.1015507"},{"key":"5_CR7","unstructured":"Ellard, D., Ledlie, J., Malkani, P., Seltzer, M.: Passive NFS tracing email and research workloads. In: USENIX Conference on File and Storage Technologies (2003)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45748-8_23","volume-title":"Peer-to-Peer Systems","author":"M. Harren","year":"2002","unstructured":"Harren, M., Hellerstein, J., Huebsch, R., Loo, B., Shenker, S., Stoica, I.: Complex queries in dht-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 242. Springer, Heidelberg (2002)"},{"key":"5_CR9","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: USITS (2003)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, T., Krishna, P.: Lazy updates for distributed search structures. In: Proceedings of ACM SIGMOD (1993)","DOI":"10.1145\/170035.170085"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-30183-7_13","volume-title":"Peer-to-Peer Systems III","author":"D.R. Karger","year":"2005","unstructured":"Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 131\u2013140. Springer, Heidelberg (2005)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45748-8_21","volume-title":"Peer-to-Peer Systems","author":"P. Keleher","year":"2002","unstructured":"Keleher, P., Bhattacharjee, B., Silaghi, B.: Are virtualized overlay networks too much of a good thing. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 225. Springer, Heidelberg (2002)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383072"},{"key":"5_CR14","unstructured":"Ratnasamy, S., Hellerstein, J., Shenker, S.: Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research (2003)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: ICDCS (2002)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"5_CR16","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: SIGCOMM (2001)","DOI":"10.1145\/383059.383071"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of SIGCOMM (2003)","DOI":"10.1145\/863955.863976"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45748-8_27","volume-title":"Peer-to-Peer Systems","author":"R. Renesse van","year":"2002","unstructured":"van Renesse, R., Birman, K.P.: Scalable management and data mining using astrolabe. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 280. Springer, Heidelberg (2002)"},{"key":"5_CR19","unstructured":"Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical Report TR-703-04, Princeton Univ. CS (2004), http:\/\/www.cs.princeton.edu\/~chizhang\/skipindex.pdf"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (2004)","DOI":"10.1109\/JSAC.2003.818784"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558989_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T12:09:41Z","timestamp":1586520581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558989_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290681","9783540319061"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11558989_5","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11558989","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}