Results 241 to 250 of about 238,735 (273)
Some of the next articles are maybe not open access.
2008
We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotchmulti-phased probing and displacement technique that has the flavors of chaining, cuckoo hashing, and linear probing, all put together, yet avoids the ...
Herlihy M., Shavit N., Tzafrir M.
openaire +1 more source
We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotchmulti-phased probing and displacement technique that has the flavors of chaining, cuckoo hashing, and linear probing, all put together, yet avoids the ...
Herlihy M., Shavit N., Tzafrir M.
openaire +1 more source
Hashing practice: analysis of hashing and universal hashing
ACM SIGMOD Record, 1988Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
openaire +1 more source
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LINIAL, N., SASSON, Ori
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LINIAL, N., SASSON, Ori
openaire +3 more sources
IEEE Transactions on Cybernetics, 2019
Recently, hashing-based approximate nearest neighbors search has attracted considerable attention, especially in big data applications, due to its low computation cost and fast retrieval speed. In the literature, most of the existing hashing algorithms are centralized. However, in many large-scale applications, the data are often stored or collected in
Shengnan Wang +2 more
openaire +2 more sources
Recently, hashing-based approximate nearest neighbors search has attracted considerable attention, especially in big data applications, due to its low computation cost and fast retrieval speed. In the literature, most of the existing hashing algorithms are centralized. However, in many large-scale applications, the data are often stored or collected in
Shengnan Wang +2 more
openaire +2 more sources