* Please help, Data Struture.
@ 1997-11-13 0:00 Aries
0 siblings, 0 replies; only message in thread
From: Aries @ 1997-11-13 0:00 UTC (permalink / raw)
Do anyone has ideas about these problems?
Larson's dynamic hashing technique uses binary trees in the index. What
would be the consequences of using eight-way trees instead? In your
answer make reference to the hash functions, the bucket-splitting
process and expected storage utilization.
Consider table-assisted hashing. Would it still work if the key of a
record were used as its signature for all addresses?
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1997-11-13 0:00 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1997-11-13 0:00 Please help, Data Struture Aries
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox