{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:01Z","timestamp":1772163961902,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T00:00:00Z","timestamp":1093824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,30]]},"DOI":"10.1145\/1015467.1015507","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T13:39:48Z","timestamp":1097156388000},"page":"353-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":308,"title":["Mercury"],"prefix":"10.1145","author":[{"given":"Ashwin R.","family":"Bharambe","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Mukesh","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Srinivasan","family":"Seshan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2004,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874075.876402"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/380749.380767"},{"key":"e_1_3_2_1_4_1","first-page":"52","volume-title":"International Workshop on Future Directions in Distributed Computing (FuDiCo) (June","author":"Castro M.","year":"2002","unstructured":"Castro , M. , Druschel , P. , Hu , Y. C. , and Rowstron , A . Exploiting network proximity in distributed hash tables . In International Workshop on Future Directions in Distributed Computing (FuDiCo) (June 2002 ), O. Babaoglu, K. Birman, and K. Marzullo, Eds. , pp. 52 -- 55 . Castro, M., Druschel, P., Hu, Y. C., and Rowstron, A. Exploiting network proximity in distributed hash tables. In International Workshop on Future Directions in Distributed Computing (FuDiCo) (June 2002), O. Babaoglu, K. Birman, and K. Marzullo, Eds., pp. 52--55."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.803069"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_8_1","volume-title":"Conference on Very Large Databases (VLDB)","author":"Ganeshan P.","year":"2004","unstructured":"Ganeshan , P. , Bawa , M. , and Garcia-Molina , H . Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems . In Conference on Very Large Databases (VLDB) ( 2004 ). To appear. Ganeshan, P., Bawa, M., and Garcia-Molina, H. Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. In Conference on Very Large Databases (VLDB) (2004). To appear."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225272"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems","author":"Harvey N. J. A.","year":"2003","unstructured":"Harvey , N. J. A. , Jones , M. B. , Saroiu , S. , Theimer , M. , and Wolman , A . Skipnet: A scalable overlay network with practical locality properties . In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems ( Seattle, WA , Mar. 2003 ). Harvey, N. J. A., Jones, M. B., Saroiu, S., Theimer, M., and Wolman, A. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (Seattle, WA, Mar. 2003)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315480"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_13"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251460.1251479"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958500"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of the 1995 IEEE Virtual Reality Symposium (VRAIS95)","author":"Macedonia M. R.","year":"1995","unstructured":"Macedonia , M. R. , Zyda , M. J. , Pratt , D. R. , Brutzman , D. P. , and Braham , P. T . Exploiting reality with multicast groups: A network architecture for large-scale virtual environments . In Proc. of the 1995 IEEE Virtual Reality Symposium (VRAIS95) ( Mar. 1995 ). Macedonia, M. R., Zyda, M. J., Pratt, D. R., Brutzman, D. P., and Braham, P. T. Exploiting reality with multicast groups: A network architecture for large-scale virtual environments. In Proc. of the 1995 IEEE Virtual Reality Symposium (VRAIS95) (Mar. 1995)."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems","author":"Manku G.","year":"2003","unstructured":"Manku , G. , Bawa , M. , and Raghavan , P . Symphony: Distributed hashing in a small world . In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems ( Seattle, WA , Mar. 2003 ). Manku, G., Bawa, M., and Raghavan, P. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (Seattle, WA, Mar. 2003)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_20_1","unstructured":"Randall D. Math 8213A - Rapidly Mixing Markov Chains. http:\/\/www.math.gatech.edu\/~randall\/Course\/lewis1.ps 2003.  Randall D. Math 8213A - Rapidly Mixing Markov Chains. http:\/\/www.math.gatech.edu\/~randall\/Course\/lewis1.ps 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/846217.847160"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"}],"event":{"name":"SIGCOMM04: ACM SIGCOMM 2004 Conference","location":"Portland Oregon USA","acronym":"SIGCOMM04","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1015467.1015507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:23:45Z","timestamp":1750253025000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015507"}},"subtitle":["supporting scalable multi-attribute range queries"],"short-title":[],"issued":{"date-parts":[[2004,8,30]]},"references-count":25,"alternative-id":["10.1145\/1015467.1015507","10.1145\/1015467"],"URL":"https:\/\/doi.org\/10.1145\/1015467.1015507","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1030194.1015507","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,8,30]]},"assertion":[{"value":"2004-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}