Author: Bas Hamstra
Date: 01:09:05 09/09/02
Go up one level in this thread
On September 08, 2002 at 17:55:26, Bas Hamstra wrote: >One problem is that a link list needs pointers. The pointers itsself eat a lot >of memory. I have some experience with this, for use in a chess position >database (in fact my book still works this way). It works well but for a >performance critical thing like a hashtable I think > >- performance would be worse than the usual approach. Not in the last place >because the actual data would be scattered through RAM, which is not the case >with a standard hashtable. > >- it's not RAM efficient. If your hashrecord is for example 8 bytes, you waste >2 bytes (=25%) at pointer space. Oops. I mean if your hashrecord is 16 bytes, you waste 4 bytes pointer space (25%). Bas.
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.