Matches in DBpedia 2014 for { <http://dbpedia.org/resource/2-choice_hashing> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- 2-choice_hashing abstract "2-choice hashing, also known as 2-choice chaining, is a variant of a hash table in which keys are added by hashing with two hash functions. The key is put in the array position with the fewer (colliding) keys. Some collision resolution scheme is needed, unless keys are kept in buckets. The average-case cost of a successful search is O(2 + (m-1)/n), where m is the number of keys and n is the size of the array. The most collisions is with high probability.".
- 2-choice_hashing wikiPageID "4436335".
- 2-choice_hashing wikiPageRevisionID "601644380".
- 2-choice_hashing hasPhotoCollection 2-choice_hashing.
- 2-choice_hashing subject Category:Hashing.
- 2-choice_hashing comment "2-choice hashing, also known as 2-choice chaining, is a variant of a hash table in which keys are added by hashing with two hash functions. The key is put in the array position with the fewer (colliding) keys. Some collision resolution scheme is needed, unless keys are kept in buckets. The average-case cost of a successful search is O(2 + (m-1)/n), where m is the number of keys and n is the size of the array. The most collisions is with high probability.".
- 2-choice_hashing label "2-choice hashing".
- 2-choice_hashing sameAs m.0c28x0.
- 2-choice_hashing sameAs Q4596934.
- 2-choice_hashing sameAs Q4596934.
- 2-choice_hashing wasDerivedFrom 2-choice_hashing?oldid=601644380.
- 2-choice_hashing isPrimaryTopicOf 2-choice_hashing.