Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Linear_probing> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Linear_probing abstract "Linear probing is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location. This is accomplished using two values - one as a starting value and one as an interval between successive values in modular arithmetic. The second value, which is the same for all keys and known as the stepsize, is repeatedly added to the starting value until a free space is found, or the entire table is traversed. (In order to traverse the entire table the stepsize should be relatively prime to the arraysize, which is why the array size is often chosen to be a prime number.)newLocation = (startingValue + stepSize) % arraySizeThis algorithm, which is used in open-addressed hash tables, provides good memory caching (if stepsize is equal to one), through good locality of reference, but also results in clustering, an unfortunately high probability that where there has been one collision there will be more. The performance of linear probing is also more sensitive to input distribution when compared to double hashing, where the stepsize is determined by another hash function applied to the value instead of a fixed stepsize as in linear probing.Given an ordinary hash function H(x), a linear probing function (H(x, i)) would be:Here H(x) is the starting value, n the size of the hash table, and the stepsize is i in this case.".
- Linear_probing wikiPageExternalLink 5_2_LinearHashTable_Linear_.html.
- Linear_probing wikiPageExternalLink 13gheileman.pdf.
- Linear_probing wikiPageID "1852304".
- Linear_probing wikiPageRevisionID "606251924".
- Linear_probing hasPhotoCollection Linear_probing.
- Linear_probing subject Category:Hashing.
- Linear_probing subject Category:Search_algorithms.
- Linear_probing type Abstraction100002137.
- Linear_probing type Act100030358.
- Linear_probing type Activity100407535.
- Linear_probing type Algorithm105847438.
- Linear_probing type Event100029378.
- Linear_probing type Procedure101023820.
- Linear_probing type PsychologicalFeature100023100.
- Linear_probing type Rule105846932.
- Linear_probing type SearchAlgorithms.
- Linear_probing type YagoPermanentlyLocatedEntity.
- Linear_probing comment "Linear probing is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location. This is accomplished using two values - one as a starting value and one as an interval between successive values in modular arithmetic. The second value, which is the same for all keys and known as the stepsize, is repeatedly added to the starting value until a free space is found, or the entire table is traversed.".
- Linear_probing label "Linear probing".
- Linear_probing label "Linear probing".
- Linear_probing sameAs Linear_probing.
- Linear_probing sameAs m.0611kc.
- Linear_probing sameAs Q2988094.
- Linear_probing sameAs Q2988094.
- Linear_probing sameAs Linear_probing.
- Linear_probing wasDerivedFrom Linear_probing?oldid=606251924.
- Linear_probing isPrimaryTopicOf Linear_probing.