Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Primary_clustering> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Primary_clustering abstract "In computer programming, primary clustering is one of two major failure modes of open addressing based hash tables, especially those using linear probing.It occurs after a hash collision causes two of the records in the hash table to hash to the same position, and causes one of the records to be moved to the next location in its probe sequence. Once this happens, the cluster formed by this pair of records is more likely to grow by the addition of even more colliding records, regardless of whether the new records hash to the same location as the first two.This phenomenon causes searches for keys within the cluster to be longer.For instance, in linear probing, a record involved in a collision is always moved to the next available hash table cell subsequent to the position given by its hash function, creating a contiguous cluster of occupied hash table cells. Whenever another record is hashed to anywhere within the cluster, it grows in size by one cell. Because of this phenomenon, it is likely that a linear-probing hash table with a constant load factor (that is, with the size of the table proportional to the number of items it stores) will have some clusters of logarithmic length, and will take logarithmic time to search for the keys within that cluster.A related phenomenon, secondary clustering, occurs more generally with open addressing modes including linear probing and quadratic probing in which the probe sequence is independent of the key, as well as in hash chaining. In this phenomenon, a low-quality hash function may cause many keys to hash to the same location, after which they all follow the same probe sequence or are placed in the same hash chain as each other, causing them to have slow access times.Both types of clustering may be reduced by using a higher-quality hash function, or by using a hashing method such as double hashing that is less susceptible to clustering.".
- Primary_clustering wikiPageID "2343202".
- Primary_clustering wikiPageLength "2657".
- Primary_clustering wikiPageOutDegree "11".
- Primary_clustering wikiPageRevisionID "700502021".
- Primary_clustering wikiPageWikiLink Category:Hashing.
- Primary_clustering wikiPageWikiLink Collision_(computer_science).
- Primary_clustering wikiPageWikiLink Computer_programming.
- Primary_clustering wikiPageWikiLink Double_hashing.
- Primary_clustering wikiPageWikiLink Hash_function.
- Primary_clustering wikiPageWikiLink Hash_table.
- Primary_clustering wikiPageWikiLink Linear_probing.
- Primary_clustering wikiPageWikiLink Open_addressing.
- Primary_clustering wikiPageWikiLink Quadratic_probing.
- Primary_clustering wikiPageWikiLinkText "Primary clustering".
- Primary_clustering wikiPageWikiLinkText "primary clustering".
- Primary_clustering wikiPageUsesTemplate Template:Comp-sci-stub.
- Primary_clustering wikiPageUsesTemplate Template:Reflist.
- Primary_clustering subject Category:Hashing.
- Primary_clustering hypernym Modes.
- Primary_clustering type PublicTransitSystem.
- Primary_clustering type Page.
- Primary_clustering type Redirect.
- Primary_clustering type Structure.
- Primary_clustering comment "In computer programming, primary clustering is one of two major failure modes of open addressing based hash tables, especially those using linear probing.It occurs after a hash collision causes two of the records in the hash table to hash to the same position, and causes one of the records to be moved to the next location in its probe sequence.".
- Primary_clustering label "Primary clustering".
- Primary_clustering sameAs Q7243111.
- Primary_clustering sameAs m.0755qv.
- Primary_clustering sameAs Q7243111.
- Primary_clustering wasDerivedFrom Primary_clustering?oldid=700502021.
- Primary_clustering isPrimaryTopicOf Primary_clustering.