Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 Karger:1997:CHR:258533.258660
%A Karger, David
%A Lehman, Eric
%A Leighton, Tom
%A Panigrahy, Rina
%A Levine, Matthew
%A Lewin, Daniel
%B Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
%C New York, NY, USA
%D 1997
%I ACM
%K bigdataseminar
%P 654--663
%R 10.1145/258533.258660
%T Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
%U http://doi.acm.org/10.1145/258533.258660
%@ 0-89791-888-6
@inproceedings{Karger:1997:CHR:258533.258660,
acmid = {258660},
added-at = {2016-12-18T19:40:59.000+0100},
address = {New York, NY, USA},
author = {Karger, David and Lehman, Eric and Leighton, Tom and Panigrahy, Rina and Levine, Matthew and Lewin, Daniel},
biburl = {https://www.bibsonomy.org/bibtex/2d226d300a085064c433e50b84b82a660/schmitz},
booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing},
doi = {10.1145/258533.258660},
interhash = {7bf72c45c6b00f561cd56c70270d516b},
intrahash = {d226d300a085064c433e50b84b82a660},
isbn = {0-89791-888-6},
keywords = {bigdataseminar},
location = {El Paso, Texas, United States},
numpages = {10},
pages = {654--663},
publisher = {ACM},
series = {STOC '97},
timestamp = {2016-12-18T19:40:59.000+0100},
title = {Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web},
url = {http://doi.acm.org/10.1145/258533.258660},
year = 1997
}