Results 11 to 20 of about 2,144,321 (256)
Double hashing thresholds via local weak convergence [PDF]
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013 A lot of interest has recently arisen in the analysis of multiple-choice "cuckoo hashing" schemes. In this context, a main performance criterion is the load threshold under which the hashing scheme is able to build a valid hashtable with high probability in the limit of large systems; various techniques have successfully been used to answer this ...
Mathieu Leconte
semanticscholar +8 more sources
More analysis of double hashing [PDF]
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988 In [8], a deep and elegant analysis shows that double hashing is asymptotically equivalent to the ideal uniform hashing up to a load factor of about 0.319. In this paper we show how a randomization technique can be used to develop a surprisingly simple proof of the result that this equivalence holds for load factors arbitrarily close to 1.
George S. Lueker, Mariko Molodowitch
semanticscholar +4 more sources
The analysis of double hashing
Journal of Computer and System Sciences, 1978 AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm in which we probe the hash table along arithmetic progressions where the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemerédi
semanticscholar +4 more sources
Frequent Itemset Generation using Double Hashing Technique
Procedia Engineering, 2012 AbstractIn data mining, frequent itemsets plays an important role which is used to identify the correlations among the fields of database.In this paper, we propose a new association rule mining algorithm called Double Hashing Based Frequent Itemsets, (DHBFI) in which hashing technology is used to store the database in vertical data format.
N. Jayalakshmi +3 more
semanticscholar +4 more sources
Double-Bit Quantization for Hashing
IEEE Transactions on Multimedia, 2021 As binary code is storage efficient and fast to compute, it has become a trend to compact real-valued data to binary codes for the nearest neighbors (NN) search in a large-scale database. However, the use of binary code for the NN search leads to low retrieval accuracy. To increase the discriminability of the binary codes of existing hash functions, in
Weihao Kong, Wu-Jun Li
semanticscholar +4 more sources
Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time [PDF]
arXiv, 2006 In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables.
Shaohua Li
arxiv +3 more sources
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence [PDF]
This paper was published in the Proceedings of the 54nd IEEE
Symposium on Foundations of Computer Science (FOCS'13), pages 90-99, 2013.
Copyright IEEE, 2013 Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +2 more sources
HASHING & DOUBLE ENCRYPTION TECHNIQUE FOR INFORMATION STORAGE IN CLOUD
International Journal of Engineering Applied Sciences and Technology, 2022 —Information storage in the cloud is very popular in recent days. The Cloud platform provides various services to its users and one of the important zones of service is the security of the information stored. This project proposes an enhanced approach of
Soorya Kumar S +2 more
openalex +2 more sources
An Efficient Retrieval System Framework for Fabrics Based on Fine-Grained Similarity [PDF]
Entropy, 2022 In the context of “double carbon”, as a traditional high energy consumption industry, the textile industry is facing the severe challenges of energy saving and emission reduction.
Jun Xiang, Ruru Pan, Weidong Gao
doaj +2 more sources
Balanced Allocations and Double Hashing [PDF]
arXiv, 2012 Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to generate multiple hash values from the initial two.
Michael Mitzenmacher
arxiv +3 more sources