{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:23:59Z","timestamp":1725517439711},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851752"},{"type":"electronic","value":"9783540851769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85176-9_3","type":"book-chapter","created":{"date-parts":[[2008,8,22]],"date-time":"2008-08-22T10:32:18Z","timestamp":1219401138000},"page":"22-33","source":"Crossref","is-referenced-by-count":1,"title":["Subrange Caching: Handling Popular Range Queries in DHTs"],"prefix":"10.1007","author":[{"given":"Marc","family":"S\u00e0nchez-Artigas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Garc\u00eda-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio G.","family":"Skarmeta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Kothari, A., Agrawal, D., Gupta, A., Suri, S.: Range addressable network: A p2p cache architecture for data ranges. In: P2P 2003 (2003)","DOI":"10.1109\/PTP.2003.1231499"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Sahin, O.D., Gupta, A., Agrawal, D., Abbadi, A.E.: A peer-to-peer framework for caching range queries. In: ICDE 2004, pp. 165\u2013177 (2004)","DOI":"10.1109\/ICDE.2004.1319993"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11687238_11","volume-title":"Current Trends in Database Technology \u2013 EDBT 2006","author":"T. Pitoura","year":"2006","unstructured":"Pitoura, T., Ntarmos, N., Triantafillou, P.: Replication, load balancing and efficient range query processing in dhts. In: Grust, T., H\u00f6pfner, H., Illarramendi, A., Jablonski, S., Mesiti, M., M\u00fcller, S., Patranjan, P.-L., Sattler, K.-U., Spiliopoulou, M., Wijsen, J. (eds.) EDBT 2006. LNCS, vol.\u00a04254, pp. 131\u2013148. Springer, Heidelberg (2006)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Cai, M., Frank, M., Chen, J., Szekely, P.: Maan: A multi-attribute addressable network for grid information services. In: GRID 2003, pp. 184\u2013192 (2003)","DOI":"10.1109\/GRID.2003.1261714"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Girdzijauskas, S., Datta, A., Aberer, K.: On small world graphs in non-uniformly distributed key spaces. In: ICDEW 2005, p. 1187 (2005)","DOI":"10.1109\/ICDE.2005.254"},{"key":"3_CR8","unstructured":"Manku, G., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: USITS 2003 (2003)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429. Springer, Heidelberg (2002)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Triantafillou, P., Pitoura, T.: Towards a unifying framework for complex query processing over structured peer-to-peer data networks. In: DBISP2P 2003, p. 169 (2003)","DOI":"10.1007\/978-3-540-24629-9_13"}],"container-title":["Lecture Notes in Computer Science","Data Management in Grid and Peer-to-Peer Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85176-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:22:34Z","timestamp":1606166554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85176-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851752","9783540851769"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85176-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}