About: Key clustering

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Key or hash function should avoid clustering, the mapping of two or more keys to consecutive slots. Such clustering may cause the lookup cost to skyrocket, even if the load factor is low and collisions are infrequent. The popular multiplicative hash is claimed to have particularly poor clustering behaviour.

Property Value
dbo:abstract
  • Key or hash function should avoid clustering, the mapping of two or more keys to consecutive slots. Such clustering may cause the lookup cost to skyrocket, even if the load factor is low and collisions are infrequent. The popular multiplicative hash is claimed to have particularly poor clustering behaviour. (en)
  • 키 클러스터링은 암호학과 관련된 개념이다. 같은 두 개의 평문을 서로 다른 두 개의 로 같은 알고리즘을 이용하여 암호화했을 때, 같은 암호문이 나오게 하는 방식, 혹은 그러한 키를 말한다. (ko)
dbo:wikiPageID
  • 4678961 (xsd:integer)
dbo:wikiPageLength
  • 1687 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1039939831 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Key or hash function should avoid clustering, the mapping of two or more keys to consecutive slots. Such clustering may cause the lookup cost to skyrocket, even if the load factor is low and collisions are infrequent. The popular multiplicative hash is claimed to have particularly poor clustering behaviour. (en)
  • 키 클러스터링은 암호학과 관련된 개념이다. 같은 두 개의 평문을 서로 다른 두 개의 로 같은 알고리즘을 이용하여 암호화했을 때, 같은 암호문이 나오게 하는 방식, 혹은 그러한 키를 말한다. (ko)
rdfs:label
  • Key clustering (en)
  • 키 클러스터링 (ko)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License