Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: opening book question

Author: David Rasmussen

Date: 12:14:19 06/13/01

Go up one level in this thread


On June 12, 2001 at 19:11:02, Peter McKenzie wrote:

>I'm not sure why people use the sorted list of records/binary search scheme.
>Wouldn't it be better to just have an on-disk hash table?
>
>Peter

I considered the idea of an on disk hashtable early on. And it is of course a
good idea, design-wise. And it might also be a good idea in practice, but I jsut
couldn't figure out a good way to handle hash-collisions. Of course, each
hashindex should contain a list of elements, but this list could not be
in-place, of course. Instead, it would have to be a pointer to the head of a
linked list, on disk. This will take up more space for the pointers, and it will
require more fseeks. But I guess it can be done in other ways.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.