Filters








23,048 Hits in 3.2 sec

Perfect Hashing Structures for Parallel Similarity Searches

Tuan Tu Tran, Mathieu Giraud, Jean-Stephane Varre
2015 2015 IEEE International Parallel and Distributed Processing Symposium Workshop  
We propose a 2-stage index structure which is based on neighborhood indexing and perfect hashing techniques.  ...  PARALLELIZING PERFECT HASH FUNCTIONS ON GPU Perfect hashing enables to retrieve, in constant time, the address associated to a given neighborhood, enabling further extension phases.  ...  Figure 5 . 5 Perfect hashing with graph assignment.  ... 
doi:10.1109/ipdpsw.2015.105 dblp:conf/ipps/TranGV15 fatcat:yixpcsuy2rhifmqlknti2svxzq

The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [article]

A.T. Akinwalle, F.T. Ibharalu
2009 arXiv   pre-print
The result shows that the two-level hash tables with three different hash functions give a superior performance over one-level hash table with two hash functions or zero-level hash table with one function  ...  In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits.  ...  Like previous result, only average case of two-level hash table (39) is faster than the average case (48) of perfect hash function.  ... 
arXiv:0905.4201v1 fatcat:gwribmmkavdxff243uvkwxh65y

The Study of a New Perfect Hash Scheme

M.W. Du, T.M. Hsieh, K.F. Jea, D.W. Shieh
1983 IEEE Transactions on Software Engineering  
A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size.  ...  Analytic results are given which are applicable when problem sizes are smalL Extensive experiments have been performed to test the approach for problems of larger size.  ...  Therefore, extensive experiments have been designed to test the approach of constructing perfect hash functions introduced in this paper.  ... 
doi:10.1109/tse.1983.236866 fatcat:iithnmswsjd6veezgwgupjbwqe

Evaluation techniques for storage hierarchies

R.L. Mattson, J. Gecsei, D. R. Slutz, I. L. Traiger
1970 IBM Systems Journal  
A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size.  ...  Analytic results are given which are applicable when problem sizes are smalL Extensive experiments have been performed to test the approach for problems of larger size.  ...  Therefore, extensive experiments have been designed to test the approach of constructing perfect hash functions introduced in this paper.  ... 
doi:10.1147/sj.92.0078 fatcat:m4rf3zx7djfe7erjzfhmnoh3uq

Geometric constructions of optimal linear perfect hash families

S.G. Barwick, Wen-Ai Jackson
2008 Finite Fields and Their Applications  
We also give constructions of optimal linear (q 2 , q, 5)-perfect hash families.  ...  A linear (q d , q, t)perfect hash family of minimal size d(t − 1) is said to be optimal.  ...  Note that for simplicity we state these constructions using field extensions of degree 2. However, they are valid for any extension of degree 2. Let q = r 4 , r a prime power.  ... 
doi:10.1016/j.ffa.2007.09.003 fatcat:adshtpu6mzfhzlxvfpxnxcfv6i

Faster Deterministic Dictionaries

Rasmus Pagh
1999 BRICS Report Series  
A by-product of the result<br />is a lookup time vs insertion time trade-off for dynamic dictionaries, which<br />is optimal for a certain class of deterministic hashing schemes.  ...  The resulting perfect hash function is efficient for w = O(log n).  ...  Miltersen [11] introduced the use of error-correcting codes in a novel approach to the construction of perfect hash functions.  ... 
doi:10.7146/brics.v6i48.20118 fatcat:ew4lq3zrhngdbl7roohypfpx4e

Perfect hashing as an almost perfect subtype test

Roland Ducournau
2008 ACM Transactions on Programming Languages and Systems  
In this paper, we propose to apply a well known technique, perfect hashing, and we show that it responds rather well in meeting these requirements.  ...  Furthermore, in the framework of Java like languages-characterized by single inheritance of classes and multiple subtyping of interfaces-perfect hashing also applies, at the same time, to method invocation  ...  Clearly, the cost of modulus-based perfect hashing is low and bit-wise and is higher, but it is surely worthwhile to save on a few cycles, since subtyping tests and invokeinterface are extensively used  ... 
doi:10.1145/1391956.1391960 fatcat:txqbyp4kvzeqjaydwzvojgs7uy

Increasing Efficiency of Computation Time For Hit Detection In BLASTN

Yuva Bharathi. R, Jebaraj Jegan. T, Punitha. P
2013 Science Park  
The Mercury BLASTN [6] design implements the hash table using a near-perfect hashing strategy, which bypasses the constraint for a perfect hash function.  ...  In previously reported designs, [1] [2] A perfect hash function has been applied to construct the hash table. A perfect hash function for a set of n keys maps each key to a distinct table.  ... 
doi:10.9780/23218045/192013/26 fatcat:npt44l2sf5goreuj3atqhc5wji

Page 5685 of Mathematical Reviews Vol. , Issue 99h [page]

1999 Mathematical Reviews  
Perfect hash families arise in compiler design, in circuit complexity theory and in cryptography. Let S be an (n,q,t)-perfect hash family.  ...  A set SC {y: V — F} of functions from V to F is an (n,q,t)-perfect hash family if, for all ¥ C V with |X|=1, there exists y € S which is injective when restricted to X.  ... 

Page 5249 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
Chapter | is an introduction to per- fect and minimal perfect hashing.  ...  This work is a monograph on perfect and minimal perfect hash- ing, well suited for including in algorithms and data structures courses taught to higher level undergraduates and beginning grad- uate students  ... 

Fast hashing of variable-length text strings

Peter K. Pearson
1990 Communications of the ACM  
Perfect Hashing A hashing function is perfect, with respect to some list of words, if it maps the words in the list onto distinct values, that is, with no collisions.  ...  Since perfectly random hashing would produce, on the Computing Practices average, 4,757 collisions, we conclude that this 16-bit extension of h performs essentially as well as random hashing.  ... 
doi:10.1145/78973.78978 fatcat:6zv2dkkrrnfgnixwiwjhv7mgbq

The INDIA lexic generator [chapter]

Michael Albinus, Werner Aßmann
1989 Lecture Notes in Computer Science  
By the way, all hash functions computed with this algorithm by the authors were minimal perfect hash functions.  ...  N-I]whereby X stands for the set of keywords and N is a cardinal number with N _ HX]I. h is called a perfect hash function if h proves as an injection (h is unique).Perfect hash functions have the advantage  ... 
doi:10.1007/3-540-51364-7_9 fatcat:64vwk2kse5ddfnozmlwldmkpny

Rank-indexed hashing: A compact construction of Bloom filters and variants

Nan Hua, Haiquan Zhao, Bill Lin, Jun Xu
2008 Network Protocols (ICNP), Proceedings of the IEEE International Conference on  
In this paper, we propose a new fingerprint hash table construction called Rank-Indexed Hashing that can achieve very compact representations.  ...  Alternative constructions based on storing fingerprints in hash tables have been proposed that offer the same functionality as some Bloom filter variants, but using less space.  ...  This perfect hashing approach achieves the optimal space requirement of log 1/ bits per element.  ... 
doi:10.1109/icnp.2008.4697026 dblp:conf/icnp/HuaZLX08 fatcat:avx7oya5bvblrk3tecgeufcpn4

Using tries to eliminate pattern collisions in perfect hashing

M.D. Brain, A.L. Tharp
1994 IEEE Transactions on Knowledge and Data Engineering  
Index Tenns-Perfect hashing, minimal perfect hashing, hashing tries, sparse array packing.  ...  Abstract4any current perfect hashing algorithms suffer from the problem of pattern collisions.  ...  EXTENSIONS OF THE NEW ALGORITHM I Fig. 7. hash function use an in-memory table.  ... 
doi:10.1109/69.277768 fatcat:tw6lneuwmrgffpvf3ikibxaakq

Perfect class hashing and numbering for object-oriented implementation

Roland Ducournau, Floréal Morandat
2010 Software, Practice & Experience  
This article presents some new results on perfect class hashing that enhance its interest.  ...  In a previous paper, we proposed a novel approach based on perfect hashing and truly constant-time hashtables for implementing subtype testing and method invocation in a dynamic loading setting.  ...  Indeed, all linear extensions are not sensible class loading orders. Thus, modelling class loading orders and testing perfect hashing on "sensible" class loading orders are still open issues.  ... 
doi:10.1002/spe.1024 fatcat:bmsvf2x73rdtrjqkbz6zzmi5c4
« Previous Showing results 1 — 15 out of 23,048 results