From: Aries <cmf41341@csun.edu>
Subject: Please help, Data Struture.
Date: 1997/11/13
Date: 1997-11-13T00:00:00+00:00 [thread overview]
Message-ID: <346ACD4B.39F3634D@csun.edu> (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?
reply other threads:[~1997-11-13 0:00 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox