Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Using Golomb Rulers for Minimizing Collisions in Closed Hashing
Responsible organisation
2004 (English)Conference paper, (Refereed) Published
Abstract [en]

We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for an item during multiple collisions. In linear probing, this sequence consists of only ones – for each collision we jump to the next location. To minimize the collisions, it turns out that one should use the Golomb ruler conditions: consecutive partial sums of the jump sequence should be distinct. The commonly used quadratic probing scheme fulfils the Golomb condition for some cases. We define a new probing scheme – Golomb probing - that fulfills the Golomb conditions for a much larger set of cases. Simulations show that Golomb probing is always better than quadratic and linear and in some cases the collisions can be reduced with 25% compared to quadratic and with more than 50% compared to linear.

Place, publisher, year, edition, pages
Chiang Mai, Thailand: Springer , 2004.
National Category
Mathematical Analysis Computer Science
Identifiers
URN: urn:nbn:se:bth-8658DOI: 10.1007/b103476Local ID: oai:bth.se:forskinfoF2CA4D4A2933CDACC12573CA004AE00CISBN: 978-3-540-24087-7 (print)OAI: oai:DiVA.org:bth-8658DiVA: diva2:836406
Conference
ASIAN - 9th Asian Computer Science Conference
Note
Lecture Notes in Computer Science, vol 3321/2004 http://springerlink.metapress.com/content/m1e8146xjqx4/Available from: 2012-09-18 Created: 2008-01-08 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lundberg, LarsLennerstad, Håkan
Mathematical AnalysisComputer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf