Skip to search formSkip to main contentSkip to account menu

Rendezvous hashing

Known as: Highest random weight hashing 
Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Cache Array Routing ProtocolConsistent hashingDistributed hash tableHash table

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A partitioning framework for Cassandra NoSQL database using Rendezvous hashing
Due to the gradual expansion in data volume used in social networks and cloud computing, the term “Big data” has appeared with… 
2015
2015
Propellant-free Spacecraft Relative Maneuvering via Atmospheric Differential Drag
Abstract : At low Earth orbits (LEO), a differential in the drag acceleration between spacecraft can be used to control their… 
2014
2014
Learning Hash Functions Using Sparse Reconstruction
Approximate nearest neighbor (ANN) search is becoming an increasingly important technique in large-scale problems. Recently many… 
2013
2013
SPACECRAFT MANEUVERING VIA ATMOSPHERIC DIFFERENTIAL DRAG USING AN ADAPTIVE LYAPUNOV CONTROLLER
An atmospheric differential drag based adaptive Lyapunov controller, originally proposed by the authors in previous work for… 
2013
2013
b-bit minwise hashing in practice
Minwise hashing is a standard technique in the context of search for approximating set similarities. The recent work [26, 32… 
2009
2009
Hohmann-Hohmann and Hohmann-Phasing Cooperative Rendezvous Maneuvers
We consider the problem of cooperative rendezvous between two satellites in circular orbits, given a fixed time for the… 
2006
2006
Locating Compromised Sensor Nodes Through Incremental Hashing Authentication
While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising… 
1995
1995
A New Algorithm for Processing Joins Using the Multilevel Grid File
Join is an operation that is frequently used and the most expensive in processing database queries. In this paper we propose a… 
1983
1983
Kinematics of rendezvous maneuvers
Mathematical expressions are obtained that solve the rendezvous problem with evasive and passive objects. Two simple rendezvous… 
1983
1983
The Reconstruction and Optimization of Trie Hashing Functions
We propose an adaptation to the trie hashing algorithm published by W. Litwin in 1980. This adaptation extends the algorithm so… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)