From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: **
X-Spam-Status: No, score=2.1 required=5.0 tests=BAYES_20,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 114592,ff8fcd17d925b131,start
X-Google-Attributes: gid114592,public
X-Google-Thread: 1153ea,ff8fcd17d925b131,start
X-Google-Attributes: gid1153ea,public
X-Google-Thread: 103376,ff8fcd17d925b131,start
X-Google-Attributes: gid103376,public
From: Aries <cmf41341@csun.edu>
Subject: Please help, Data Struture.
Date: 1997/11/13
Message-ID: <346ACD4B.39F3634D@csun.edu>#1/1
X-Deja-AN: 289188429
Reply-To: cmf41341@csun.edu
Organization: EarthLink Network, Inc.
Newsgroups: alt.comp.lang.learn.c-c++,comp.lang,comp.lang.ada
Date: 1997-11-13T00:00:00+00:00
List-Id: <comp.lang.ada>


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?