Home >  Term: spiral storage
spiral storage

A dynamic hashing table that grows a few slots at a time. It uses a hash function, h, with a range of (0,1). For a key, k, an intermediate value, x=⌈ S-h(k)⌉ +h(k), is computed to find the final slot, ⌊ dx⌋, where d>1 is called the growth factor. To increase the number of slots, increase S to S' and rehash any keys from ⌊ dS⌋ to ⌊ dS'⌋-1.

0 0

ผู้สร้าง

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.