Results 251 to 260 of about 27,498 (296)
Some of the next articles are maybe not open access.

On the use of Extendible Hashing without hashing

Information Processing Letters, 1984
On 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.
Ulrich Bechtold, Klaus Küspert
openaire   +1 more source

Hash length prediction for video hashing

2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), 2016
Video 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 0001   +3 more
openaire   +2 more sources

Nonoblivious hashing

Journal of the ACM, 1988
Nonoblivious hashing, where information gathered from unsuccessful probes is used to modify subsequent probe strategy, is introduced and used to obtain the following results for static lookup on full tables: (1) An
Amos Fiat   +3 more
openaire   +2 more sources

Hopscotch Hashing

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

Load Balancing Hashing in Geographic Hash Tables

IEEE Transactions on Parallel and Distributed Systems, 2012
In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic ...
Renda Elena, Resta Giovanni, Santi Paolo
openaire   +2 more sources

Hashing practice: analysis of hashing and universal hashing

ACM SIGMOD Record, 1988
Much 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

Adaptive hashing

Information Systems, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yeong-Shiou Hsiao, Alan L. Tharp
openaire   +2 more sources

Dynamic hashing

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

Trie hashing

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   +1 more source

Collaborative Hashing

2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014
Hashing technique has become a promising approach for fast similarity search. Most of existing hashing research pursue the binary codes for the same type of entities by preserving their similarities. In practice, there are many scenarios involving nearest neighbor search on the data given in matrix form, where two different types of, yet naturally ...
Xianglong Liu 0001   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy