@article {1015507,
	title = {Mercury: supporting scalable multi-attribute range queries},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {34},
	number = {4},
	year = {2004},
	pages = {353{\textendash}366},
	publisher = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game{\textquoteright}s messaging overheard significantly compared to a na{\"\i}ve approach.},
	keywords = {distributed hash table, load balancing, mercury, P2P, random sampling, range queries},
	issn = {0146-4833},
	doi = {10.1145/1030194.1015507},
	url = {http://portal.acm.org/citation.cfm?id=1030194.1015507$\#$},
	author = {Bharambe, Ashwin R. and Agrawal, Mukesh and Seshan, Srinivasan}
}

{"_id":"QnsqEhRtSZ6CW9esC","bibbaseid":"bharambe-agrawal-seshan-mercurysupportingscalablemultiattributerangequeries-2004","downloads":0,"creationDate":"2018-07-03T04:50:27.265Z","title":"Mercury: supporting scalable multi-attribute range queries","author_short":["Bharambe, A. R.","Agrawal, M.","Seshan, S."],"year":2004,"bibtype":"article","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"article","type":"article","title":"Mercury: supporting scalable multi-attribute range queries","journal":"SIGCOMM Comput. Commun. Rev.","volume":"34","number":"4","year":"2004","pages":"353\\textendash366","publisher":"ACM","address":"New York, NY, USA","abstract":"This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game\\textquoterights messaging overheard significantly compared to a na\\̈ive approach.","keywords":"distributed hash table, load balancing, mercury, P2P, random sampling, range queries","issn":"0146-4833","doi":"10.1145/1030194.1015507","url":"http://portal.acm.org/citation.cfm?id=1030194.1015507$#$","author":[{"propositions":[],"lastnames":["Bharambe"],"firstnames":["Ashwin","R."],"suffixes":[]},{"propositions":[],"lastnames":["Agrawal"],"firstnames":["Mukesh"],"suffixes":[]},{"propositions":[],"lastnames":["Seshan"],"firstnames":["Srinivasan"],"suffixes":[]}],"bibtex":"@article {1015507,\n\ttitle = {Mercury: supporting scalable multi-attribute range queries},\n\tjournal = {SIGCOMM Comput. Commun. Rev.},\n\tvolume = {34},\n\tnumber = {4},\n\tyear = {2004},\n\tpages = {353{\\textendash}366},\n\tpublisher = {ACM},\n\taddress = {New York, NY, USA},\n\tabstract = {This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game{\\textquoteright}s messaging overheard significantly compared to a na{\\\"\\i}ve approach.},\n\tkeywords = {distributed hash table, load balancing, mercury, P2P, random sampling, range queries},\n\tissn = {0146-4833},\n\tdoi = {10.1145/1030194.1015507},\n\turl = {http://portal.acm.org/citation.cfm?id=1030194.1015507$\\#$},\n\tauthor = {Bharambe, Ashwin R. and Agrawal, Mukesh and Seshan, Srinivasan}\n}\n","author_short":["Bharambe, A. R.","Agrawal, M.","Seshan, S."],"key":"1015507","id":"1015507","bibbaseid":"bharambe-agrawal-seshan-mercurysupportingscalablemultiattributerangequeries-2004","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1030194.1015507$#$"},"keyword":["distributed hash table","load balancing","mercury","P2P","random sampling","range queries"],"downloads":0},"search_terms":["mercury","supporting","scalable","multi","attribute","range","queries","bharambe","agrawal","seshan"],"keywords":["distributed hash table","load balancing","mercury","p2p","random sampling","range queries"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}