Results 291 to 300 of about 94,016 (314)
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 +2 more sources
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 +2 more sources
Hash length prediction for video hashing
2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), 2016Video hashing has attracted increasing attention in the field of video searching. However, there was no technical research on the prediction of hash length, which is extremely important in mobile circumstance. In this paper, a hash length prediction method is proposed for video hashing in the case of video copy detection. The video feature is mapped to
Jiande Sun +3 more
openaire +2 more sources
On the use of Extendible Hashing without hashing
Information Processing Letters, 1984On fait un rapport sur l'usage de nombres decimaux codes en EBCDIC qui sont stockes dans la table ExHash sans randomisation anterieure. Ainsi on ne distingue pas les cles des pseudocles. Ceci prevoit donc le traitement sequentiel des enregistrements dans l'ordre de cle qui est communement utilise dans les applications de base de donnee.
Klaus Küspert, Ulrich Bechtold
openaire +2 more sources
BIT, 1978
A new file organisation called dynamic hashing is presented. The organisation is based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file.
openaire +3 more sources
A new file organisation called dynamic hashing is presented. The organisation is based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file.
openaire +3 more sources
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 +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LINIAL, N., SASSON, Ori
openaire +4 more sources
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing, 2008Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications.
Udi Wieder +2 more
openaire +4 more sources
Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81, 1981
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file may be highly dynamic, even may be constituted entirely with insertions. The load factor is typically about 70 %. The search for a record is performed in only one disk access, for files attaining millions of records.
openaire +2 more sources
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file may be highly dynamic, even may be constituted entirely with insertions. The load factor is typically about 70 %. The search for a record is performed in only one disk access, for files attaining millions of records.
openaire +2 more sources
Hashing and Hashed Message Authentication Codes
2019Now that you know the importance of random numbers in cryptography and how to generate them, let’s look at one of the pillars of cryptography. In Chapter 2, I mentioned the four pillars of modern cryptography: cryptography, integrity, authentication, and non-repudiation. In this chapter, we explore integrity and authentication by looking at the various
openaire +2 more sources
2014
Hashing is a technique for mapping data from a large set to limited space in a much smaller set. This appendix provides an overview of the subject. The appendix covers the fundamentals of hashing under the following captions:
Shripad V. Godbole, Elvis C. Foster
openaire +2 more sources
Hashing is a technique for mapping data from a large set to limited space in a much smaller set. This appendix provides an overview of the subject. The appendix covers the fundamentals of hashing under the following captions:
Shripad V. Godbole, Elvis C. Foster
openaire +2 more sources