{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,17]],"date-time":"2026-11-17T18:00:11Z","timestamp":1794938411220,"version":"4.9.1"},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1145\/258533.258660","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T11:40:52Z","timestamp":1069760452000},"page":"654-663","source":"Crossref","is-referenced-by-count":1326,"title":["Consistent hashing and random trees"],"prefix":"10.1145","author":[{"given":"David","family":"Karger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Lehman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Leighton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Levine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lewin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","event":{"name":"the twenty-ninth annual ACM symposium","location":"El Paso, Texas, United States","acronym":"STOC '97","number":"29","sponsor":["SIGACT, ACM Special Interest Group on Algorithms and Computation Theory"],"start":{"date-parts":[[1997,5,4]]},"end":{"date-parts":[[1997,5,6]]}},"container-title":["Proceedings of the twenty-ninth annual ACM symposium on Theory of computing  - STOC '97"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/258533.258660","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=258660&amp;ftid=24742&amp;dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:01:04Z","timestamp":1750262464000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=258533.258660"}},"subtitle":["distributed caching protocols for relieving hot spots on the World Wide Web"],"proceedings-subject":"Theory of computing","short-title":[],"issued":{"date-parts":[[1997]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/258533.258660","relation":{},"subject":[],"published":{"date-parts":[[1997]]}}}