Filters








35,932 Hits in 2.7 sec

The analysis of double hashing

Leo J. Guibas, Endre Szemeredi
1978 Journal of computer and system sciences (Print)  
DOUBLE HASHING 227 We wish to organize our records in such a way that (1) we can quickly find the record having a given key K (if such a record exists), and (2) we can easily add additional records to  ...  It is clear that, unless we are careful, the searches in question can become quite protected for a large collection of records. the hash table "" 0 '" full:, )), '" 1, k KEY INFO A RECORD the probe path  ...  In this paper we exclusively concern ourselves with the analysis of double hashing.  ... 
doi:10.1016/0022-0000(78)90046-6 fatcat:bnuajakfd5dw3gsjl44bnpkkgq

Complexity analysis and performance of double hashing sort algorithm

Hazem M. Bahig
2019 Journal of the Egyptian Mathematical Society  
Recently, a sequential algorithm, called double hashing sort (DHS) algorithm, has been shown to exceed the quick sort algorithm in performance by 10-25%.  ...  We propose a new complexity analysis for the DHS algorithm based on the relation between the size of the input and the domain of the input elements.  ...  Acknowledgements None Funding None Bahig Journal of the Egyptian Mathematical Society (2019) 27:3  ... 
doi:10.1186/s42787-019-0004-2 fatcat:3uocgzsharf3xgdypw7chgjpke

More Analysis of Double Hashing for Balanced Allocations

Michael Mitzenmacher
2015 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)  
It has been shown previously that asymptotically the performance of double hashing and fully random hashing is the same in the balanced allocation paradigm using fluid limit methods.  ...  Here we extend a coupling argument used by Lueker and Molodowitch to show that double hashing and ideal uniform hashing are asymptotically equivalent in the setting of open address hash tables to the balanced  ...  For Bloom filters, Kirsch and Mitzenmacher [7] , starting from the empirical analysis by Dillinger and Manolios [4] , prove that using double hashing has asymptotically negligible effects on Bloom filter  ... 
doi:10.1137/1.9781611974324.1 dblp:conf/analco/Mitzenmacher16 fatcat:e3cru7b3nzbdjhufehr2tbjihm

A Security Analysis of Double-Block-Length Hash Functions with the Rate 1

S. HIROSE
2006 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
In this article, the security of double-block-length hash functions with the rate 1 is analyzed, whose compression functions are composed of block ciphers with their key length twice larger than their  ...  First, the analysis by Satoh, Haga and Kurosawa is investigated, and it is shown that there exists a case uncovered by their analysis.  ...  .1093/ietfec/e89-a. 10 .2575 double-block-length (DBL).  ... 
doi:10.1093/ietfec/e89-a.10.2575 fatcat:73ic6hlfnvf6xdy5jathjxcfje

Analysis of the Efficiency for Some Selected Double-Block-Length Hash Functions Based on AES/LEA
AES/LEA 기반 이중블록길이 해쉬함수에 대한 효율성 분석

Dowon Kim, Jongsung Kim
2016 Journal of the Korea Institute of Information Security and Cryptology  
We analyze the efficiency of the double-block-length hash functions, Abreast-DM, HIROSE, MDC-2, MJH, MJH-Double based on AES or LEA.  ...  In terms of memory, the hash functions with LEA has 20~30 times more efficient than those with AES.  ...  Comparison of the Compression Functions (Key/ Message length -bits, Block length -128bit) 운드 수는 키 길이에 따라 각각 24/28/32 라운드를 가진다.  ... 
doi:10.13089/jkiisc.2016.26.6.1353 fatcat:tzv2bu63lzbqzf3rqyerr76rqq

Peeling arguments and double hashing

Michael Mitzenmacher, Justin Thaler
2012 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In this paper, we make note of an interesting aspect of these types of processes: the results are generally the same when the randomness is structured in the manner of double hashing.  ...  The analysis of several algorithms and data structures can be reduced to the analysis of the following greedy "peeling" process: start with a random hypergraph; find a vertex of degree at most k, and remove  ...  analysis for the double hashing setting.  ... 
doi:10.1109/allerton.2012.6483344 dblp:conf/allerton/MitzenmacherT12 fatcat:q3vhlmwjm5bmbnfmi3kbz2ttwm

Improved exponential hashing

Wenbin Luo, Gregory L. Heileman
2004 IEICE Electronics Express  
We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table  ...  Also, some theoretic analysis is provided along with the experimental results.  ...  It explains why improved exponential hashing outperforms double hashing. The following experimental results support our analysis.  ... 
doi:10.1587/elex.1.150 fatcat:2ynh3urcurbc7mcb5fdyx3jfbi

Balanced Allocations and Double Hashing [article]

Michael Mitzenmacher
2014 arXiv   pre-print
We then provide theoretical results that explain the behavior of double hashing in this context.  ...  We first perform an empirical study showing that, surprisingly, the performance difference between double hashing and fully random hashing appears negligible in the standard balanced allocation paradigm  ...  This opens the door to the interesting possibility that double hashing can be suitable for other problem or analyses where this type of fluid limit analysis applies, such as low-density parity-check codes  ... 
arXiv:1209.5360v4 fatcat:5mkninmy3nh35bwnilm4g3ipeu

Fast and Accurate Bitstate Verification for SPIN [chapter]

Peter C. Dillinger, Panagiotis Manolios
2004 Lecture Notes in Computer Science  
Because hash computation accounts for an overwhelming portion of the total execution cost of bitstate verification with SPIN, adding additional independent hash functions would slow down the process tremendously  ...  We present efficient ways of computing multiple hash values that, despite sacrificing independence, give virtually the same accuracy and even yield a speed improvement in the two hash function case when  ...  Double Hashing Accuracy To test the accuracy of double hashing with respect to the expected number of omissions, we ran 3SPIN on a 606,211-state instance of PFTP using both double hashing and independent  ... 
doi:10.1007/978-3-540-24732-6_5 fatcat:ki5fr663ozfvndb2wdikzkvyay

Model Size Reduction Using Frequency Based Double Hashing for Recommender Systems [article]

Caojin Zhang, Yicun Liu, Yuanpu Xie, Sofia Ira Ktena, Alykhan Tejani, Akshay Gupta, Pranay Kumar Myana, Deepak Dilipkumar, Suvadip Paul, Ikuhiro Ihara, Prasang Upadhyaya, Ferenc Huszar (+1 others)
2020 arXiv   pre-print
In this paper, we propose a hybrid hashing method to combine frequency hashing and double hashing techniques for model size reduction, without compromising performance.  ...  The large model size usually entails a cost, in the range of millions of dollars, for storage and communication with the inference services.  ...  Theoretical Analysis We formulate the hash table size, computational complexity and collision rate of the different hashing methods in the table below.  ... 
arXiv:2007.14523v1 fatcat:oh7xmkcu5jdgdk6uacpo2aiyle

More analysis of double hashing

George S. Lueker, Mariko Molodowitch
1993 Combinatorica  
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.  ...  of the paper was presented at the  ...  We also thank David Eppstein for enabling us to simplify the proof of that section by pointing out the relevance of graph coloring to the problem.  ... 
doi:10.1007/bf01202791 fatcat:l5bqeqwg7rab3gdc5a63wqfm5y

A Case for Partitioned Bloom Filters [article]

Paulo Sérgio Almeida
2020 arXiv   pre-print
Partitioned Bloom filters exhibit a uniform distribution of the FPR over the domain and are robust to the naive use of double hashing, having no weak spots.  ...  In this paper, by performing an in-depth analysis, first we show that the FPR advantage of standard Bloom filters is smaller than thought; more importantly, by studying the per-element FPR, we show that  ...  Dillinger's PhD dissertation [13] , which includes a detailed study of different forms of double and triple hashing, already recognized the existence of pitfalls, specially in naive double hashing.  ... 
arXiv:2009.11789v1 fatcat:x2gwrrjzxfgldkzgt7bs2g6mju

Bloom Filters in Probabilistic Verification [chapter]

Peter C. Dillinger, Panagiotis Manolios
2004 Lecture Notes in Computer Science  
The idea is that we can introduce large dependences among the hash functions of a Bloom filter with almost no observable effect on accuracy, and because computation of independent hash functions was the  ...  We present a mathematical analysis of Bloom filters in verification in unprecedented detail, which enables us to give a fresh comparison between hash compaction and Bloom filters.  ...  Enhanced Double Hashing A scheme we call "enhanced double hashing" comes much closer to the theoretical accuracy of two-index fingerprinting and has a per-k cost similar to double hashing.  ... 
doi:10.1007/978-3-540-30494-4_26 fatcat:oilxipmozrgzfg6ppw62we3yqi

Combining Model Checking and Symbolic Execution for Software Testing [chapter]

Corina S. Păsăreanu
2012 Lecture Notes in Computer Science  
(double x) {...} void test(int x, int y) {"x>3.0","x<=3.0"}) double hash(double x) {  ...  for multiple Statechart formalisms -Captures interactions between components -Formal semantics that captures the variants of Statecharts Pluggable Semantics UML Rhapsody Stateflow V j Systematic Analysis  ... 
doi:10.1007/978-3-642-30473-6_2 fatcat:l4hkrwpqgja4xmab6cya2ex4nu

More Analysis of Double Hashing for Balanced Allocations [article]

Michael Mitzenmacher
2015 arXiv   pre-print
It has been shown previously that asymptotically the performance of double hashing and fully random hashing is the same in the balanced allocation paradigm using fluid limit methods.  ...  Here we extend a coupling argument used by Lueker and Molodowitch to show that double hashing and ideal uniform hashing are asymptotically equivalent in the setting of open address hash tables to the balanced  ...  For Bloom filters, Kirsch and Mitzenmacher [7] , starting from the empirical analysis by Dillinger and Manolios [4] , prove that using double hashing has asymptotically negligible effects on Bloom filter  ... 
arXiv:1503.00658v1 fatcat:mkolh6dtvzbs3hdiakyrn4rstm
« Previous Showing results 1 — 15 out of 35,932 results