{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:16Z","timestamp":1725489556486},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74573-0_21","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T09:29:07Z","timestamp":1187861347000},"page":"197-206","source":"Crossref","is-referenced-by-count":5,"title":["Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables"],"prefix":"10.1007","author":[{"given":"Nuno","family":"Lopes","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Baquero","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","first-page":"149","volume-title":"Proceedings of the ACM SIGCOMM 2001 Conference","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, pp. 149\u2013160. ACM Press, New York (2001)"},{"key":"21_CR2","first-page":"329","volume-title":"Proceedings of the 18th IFIP\/ACM International Conf. on Distributed Systems Platforms","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP\/ACM International Conf. on Distributed Systems Platforms, Germany, pp. 329\u2013350. ACM Press, New York (2001)"},{"key":"21_CR3","first-page":"161","volume-title":"Proceedings of the ACM SIGCOMM 2001 Conference","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of the ACM SIGCOMM 2001 Conference, pp. 161\u2013172. ACM Press, New York (2001)"},{"key":"21_CR4","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. In: Proceedings of the USENIX Annual Technical Conference, pp. 127\u2013140 (2004)"},{"key":"21_CR5","unstructured":"Gupta, A., Liskov, B., Rodrigues, R.: Efficient routing for peer-to-peer overlays. In: Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), pp. 113\u2013126 (2004)"},{"key":"21_CR6","unstructured":"Ramasubramanian, V., Sirer, E.G.: Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In: Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), pp. 99\u2013112 (2004)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Bharambe, A., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: Proceedings of SIGCOMM 2004, pp. 353\u2013366 (2004)","DOI":"10.1145\/1030194.1015507"},{"key":"21_CR8","first-page":"384","volume-title":"Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384\u2013393. ACM, New York (2003)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11558989_5","volume-title":"Peer-to-Peer Systems IV","author":"C. Zhang","year":"2005","unstructured":"Zhang, C., Krishnamurthy, A., Wang, R.: Brushwood: Distributed trees in peer-to-peer systems. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 47\u201357. Springer, Heidelberg (2005)"},{"key":"21_CR10","first-page":"97","volume-title":"Proceedings of the ACM SIGCOMM 2005 Conference","author":"Y. Chawathe","year":"2005","unstructured":"Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Hellerstein, J., Shenker, S.: A case study in building layered dht applications. In: Proceedings of the ACM SIGCOMM 2005 Conference, pp. 97\u2013108. ACM Press, New York (2005)"},{"key":"21_CR11","first-page":"239","volume-title":"Proceedings of the 12th IEEE Int. Conference on Network Protocols (ICNP 2004)","author":"J. Gao","year":"2004","unstructured":"Gao, J., Steenkiste, P.: An adaptative protocol for efficient support of range queries in dht-based systems. In: Proceedings of the 12th IEEE Int. Conference on Network Protocols (ICNP 2004), pp. 239\u2013250. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"21_CR12","unstructured":"Zheng, C., Shen, G., Li, S., Shenker, S.: Distributed segment tree: Support of range query and cover query over dht. In: Electronic publications of the 5th International Workshop on Peer-to-Peer Systems (IPTPS 2006), California, USA (2006)"},{"key":"21_CR13","volume-title":"Human Behaviour and the Principle of Least Effort","author":"G. Zipf","year":"1949","unstructured":"Zipf, G.: Human Behaviour and the Principle of Least Effort. Addison-Wesley, Reading (1949)"},{"key":"21_CR14","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1989","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1989)"},{"key":"21_CR15","unstructured":"Jagadish, H., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, pp. 661\u2013672 (2005)"},{"key":"21_CR16","unstructured":"Lopes, N., Baquero, C.: Using distributed balanced trees over dhts for building large-scale indexes. Technical report, University of Minho (October 2006)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/170035.170085","volume-title":"Proceedings of the 1993 ACM SIGMOD Intl. Conf. on Management of data","author":"T. Johnson","year":"1993","unstructured":"Johnson, T., Krishna, P.: Lazy updates for distributed data structures. In: Proceedings of the 1993 ACM SIGMOD Intl. Conf. on Management of data, pp. 337\u2013346. ACM Press, New York (1993)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Sean Rhea, B.G., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: Opendht: A public dht service and its uses. In: Proceedings of SIGCOMM 2005, pp. 73\u201384 (2005)","DOI":"10.1145\/1090191.1080102"}],"container-title":["Lecture Notes in Computer Science","Network-Based Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74573-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:30Z","timestamp":1619519130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74573-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745723"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74573-0_21","relation":{},"subject":[]}}