Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web Export

@proceedings{citeulike:4303, abstract = {Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.}, address = {New York, NY, USA}, author = {Karger, David and Lehman, Eric and Leighton, Tom and Panigrahy, Rina and Levine, Matthew and Lewin, Daniel}, booktitle = {STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing}, citeulike-article-id = {4303}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=258660}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/258533.258660}, doi = {10.1145/258533.258660}, isbn = {0-89791-888-6}, keywords = {hashing}, location = {El Paso, Texas, United States}, pages = {654--663}, posted-at = {2009-02-02 16:52:31}, priority = {2}, publisher = {ACM}, title = {Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web}, url = {http://dx.doi.org/10.1145/258533.258660}, year = {1997} }

TY - CONF ID - citeulike:4303 L3 - citeulike-article-id:4303 N2 - Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. CY - El Paso, Texas, United States SN - 0-89791-888-6 AD - New York, NY, USA EP - 663 TI - Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web PB - ACM T2 - STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing SP - 654 KW - hashing AU - Karger, David AU - Lehman, Eric AU - Leighton, Tom AU - Panigrahy, Rina AU - Levine, Matthew AU - Lewin, Daniel PY - 1997/// UR - http://dx.doi.org/10.1145/258533.258660 ER -