Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Double_hashing> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Double_hashing abstract "Double hashing is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision-resolution technique in open-addressed hash tables. Double hashing is implemented in many popular libraries.Like linear probing, it uses one hash value as a starting point and then repeatedly steps forward an interval until the desired value is located, an empty location is reached, or the entire table has been searched; but this interval is decided using a second, independent hash function (hence the name double hashing). Unlike linear probing and quadratic probing, the interval depends on the data, so that even values mapping to the same location have different bucket sequences; this minimizes repeated collisions and the effects of clustering. Given two randomly, uniformly, and independently selected hash functions and , the ith location in the bucket sequence for value k in a hash table is: Generally, and are selected from a set of universal hash functions.".
- Double_hashing wikiPageExternalLink Hashing.html.
- Double_hashing wikiPageExternalLink 13gheileman.pdf.
- Double_hashing wikiPageID "1583816".
- Double_hashing wikiPageRevisionID "587274240".
- Double_hashing hasPhotoCollection Double_hashing.
- Double_hashing subject Category:Hashing.
- Double_hashing subject Category:Search_algorithms.
- Double_hashing type Abstraction100002137.
- Double_hashing type Act100030358.
- Double_hashing type Activity100407535.
- Double_hashing type Algorithm105847438.
- Double_hashing type Event100029378.
- Double_hashing type Procedure101023820.
- Double_hashing type PsychologicalFeature100023100.
- Double_hashing type Rule105846932.
- Double_hashing type SearchAlgorithms.
- Double_hashing type YagoPermanentlyLocatedEntity.
- Double_hashing comment "Double hashing is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision-resolution technique in open-addressed hash tables.".
- Double_hashing label "Doppel-Hashing".
- Double_hashing label "Double hashing".
- Double_hashing label "Double hashing".
- Double_hashing sameAs Doppel-Hashing.
- Double_hashing sameAs 이중_해시.
- Double_hashing sameAs Double_hashing.
- Double_hashing sameAs m.05d9x5.
- Double_hashing sameAs Q478351.
- Double_hashing sameAs Q478351.
- Double_hashing sameAs Double_hashing.
- Double_hashing wasDerivedFrom Double_hashing?oldid=587274240.
- Double_hashing isPrimaryTopicOf Double_hashing.