Concept
Trie
Related publications (11)
Cache-Aware Lock-Free Concurrent Hash Tries
Martin Odersky, Aleksandar Prokopec
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each ...
2011Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees
With the appearance of Peer-to-Peer information systems the interest in scalable and decentralized data access structures is attracting increasingly interest. We propose to that end P-Grid, a scalable data access structure resulting from the distribution o ...
2002Ideal Hash Trees
Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant, indep ...
2001