Re^3: A memory efficient hash, trading off speed

If anything, you should probably switch to a structure like

$hash{"Keyword\0Symbol_1"} = $Weighting[1];
$hash{"Keyword\0Symbol_2"} = $Weighting[2];
[download]

That way you still get full hash lookup performance on the entire (two dimensional) key. And you avoid creating whole legions of hashes. That should pretty much fix 90% of your problem. And such a flat hash is trivial to tie to a DBM file.

Don't knock DBMs without benchmarking them. DBM files are specifically laid out to allow for rapid retrieval - paging just indiscriminately swaps out whatever seems least necessary, including other parts of the system besides the data. Drawing any conclusions about one based on the other borders on ridiculous.

Makeshifts last the longest.

Comment on Re^3: A memory efficient hash, trading off speed - does it already exist? Download Code

Replies are listed 'Best First'.
Re: Re^3: A memory efficient hash, trading off speed - does it already exist? by JPaul (Hermit) on Feb 06, 2003 at 17:57 UTC
This requires I know what the following symbol is. The point of the hash is to look up potential following symbols of the keyword, unless there's someway to glob hash keys without going through them to compile a list, it's not going to work at all. JP, -- Alexander Widdlemouse undid his bellybutton and his bum dropped off --	[reply]
Re^5: A memory efficient hash, trading off speed - does it already exist? by Aristotle (Chancellor) on Feb 07, 2003 at 12:57 UTC
Then keep a key with a list of symbols. `$hash{"Keyword"} = "Symbol_1\0Symbol_2\0Symbol_3"; my $key = "Keyword"; for my $symbol (split /\0/, $hash{$key}, -1) { my $weight = $hash{"$key\0$symbol"}; # ... }` [download] Makeshifts last the longest.	[reply] [d/l]
Re: Re^5: A memory efficient hash, trading off speed - does it already exist? by JPaul (Hermit) on Feb 07, 2003 at 16:01 UTC
So where is the advantage of that over what I chose to use? `$hash{"Keyword"} = "Symbol_1 \x255 5 \O Symbol_2 \x255 4";` [download] I use a single hash (As opposed to two - the lookup hash and the one with values), and when I'm doing accesses I throw it into a temporary hash for quicker lookups on multiple hits to the same keyword. JP, -- Alexander Widdlemouse undid his bellybutton and his bum dropped off --	[reply] [d/l]
Re^7: A memory efficient hash, trading off speed - does it already exist? by Aristotle (Chancellor) on Feb 07, 2003 at 20:29 UTC


Welcome to the Monastery
	PerlMonks

Re^3: A memory efficient hash, trading off speed - does it already exist?