{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:16:13Z","timestamp":1742390173136,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/icde.2008.4497509","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T15:04:39Z","timestamp":1209481479000},"page":"1003-1012","source":"Crossref","is-referenced-by-count":7,"title":["Accelerating Lookups in P2P Systems using Peer Caching"],"prefix":"10.1109","author":[{"given":"Supratim","family":"Deb","sequence":"first","affiliation":[]},{"given":"Prakash","family":"Linga","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Rastogi","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"cup: controlled update propagation in p2p networks","author":"roussopoulos","year":"2003","journal-title":"USENIX"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2002.1022237"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857106"},{"key":"15","article-title":"p-grid: a self-organizing access structure for p2p information systems","author":"aberer","year":"2001","journal-title":"CoopIS"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290674"},{"key":"13","article-title":"a comparative study of current dns with dht-based alternatives","author":"pappas","year":"2006","journal-title":"INFOCOM"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803905"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015504"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015505"},{"key":"21","article-title":"epichord: parallelizing the chord lookup algorithm with reactive routing state management","author":"leone","year":"2004","journal-title":"ICON"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209237"},{"key":"22","article-title":"self-optimizing dhts using request profiling","author":"bejan","year":"2004","journal-title":"OPODIS"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/543614.543615"},{"key":"24","article-title":"peer caching for faster lookups in peer-to-peer systems (full version)","author":"deb","year":"2006","journal-title":"Bell Labs Technical Report"},{"key":"25","first-page":"628","article-title":"the least weight subsequence problem","volume":"16","author":"hirschberg","year":"1987","journal-title":"J Computing"},{"year":"0","key":"26"},{"year":"0","key":"3"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1145\/964723.383071","article-title":"chord: a scalable p2p lookup service for internet applications","author":"stoica","year":"2001","journal-title":"SIGCOMM"},{"key":"10","first-page":"331","article-title":"beehive: exploiting power law query distributions for 0(1) lookup performance in p2p overlays","author":"ramasubramanian","year":"2004","journal-title":"NSDI"},{"key":"1","article-title":"pastry: scalable, decentralized object location, and routing for large-scale p2p systems","author":"rowstron","year":"2001","journal-title":"Middleware"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818805"},{"key":"6","article-title":"serving dns using chord","author":"cox","year":"2002","journal-title":"IPTPS"},{"journal-title":"Kademlia A P2P information system based on the XOR metric","year":"2002","author":"maymounkov","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383072"},{"key":"9","article-title":"bandwidth- efficient management of dht routing tables","author":"li","year":"2005","journal-title":"NSDI"},{"key":"8","article-title":"a performance vs. cost framework for evaluating dht design tradeoffs under chum","author":"li","year":"2005","journal-title":"INFOCOM"}],"event":{"name":"2008 IEEE 24th International Conference on Data Engineering (ICDE 2008)","start":{"date-parts":[[2008,4,7]]},"location":"Cancun, Mexico","end":{"date-parts":[[2008,4,12]]}},"container-title":["2008 IEEE 24th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4492792\/4497384\/04497509.pdf?arnumber=4497509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T03:36:02Z","timestamp":1497756962000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4497509\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icde.2008.4497509","relation":{},"subject":[],"published":{"date-parts":[[2008,4]]}}}