Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: Re: A (memory) poor man's hash

by demerphq (Chancellor)
on Nov 21, 2003 at 19:35 UTC ( #309018=note: print w/ replies, xml ) Need Help??

in reply to Re: A (memory) poor man's hash
in thread A (memory) poor man's <strike>hash</strike> lookup table.

Yeah it appears to be a hybrid Trie implementation. Which I personally find extremely amusing. The primary drawback with using Trie's is that they are typically terribly wasteful of memory. (Except if the data set is extremely dense.) Which is why it turns out that most times Tries are implemented they are implemented in a hybrid form, or are designed to work on a limited data set or both. OTOH one advantage of a pure Trie lookup is that a C implementation of the algorithm performs similarly or better than a hash lookup but does prefix matching as well.


    First they ignore you, then they laugh at you, then they fight you, then you win.
    -- Gandhi

Comment on Re: Re: A (memory) poor man's hash
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://309018]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2015-11-26 15:58 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (701 votes), past polls