[fpc-pascal] Re: Suffix Trie implementation, please review

leledumbo leledumbo_cool at yahoo.co.id
Wed May 25 17:57:08 CEST 2011

> I guess you forgot the attachment?

My bad... well it was midnight here ;)
There you go: 

> BTW, do you know the hashtrie component?

Only ever heard of, never know the details. Thanks, this could be a lesson
to learn.
The improvement over hashtable seems to be in the lookup, so it still uses
hashing to generate initial index which in simple case, like in the page you
point, operates on the whole string (i.e. O(n)). The lookup would take
additional processing. Anyway, it's not really comparable to suffix tries.
Instead, it's comparable to (prefix) tries. For lookup and update, tries
should perform better. But the disadvantage is that no item may get out once
it gets in (at least not so easy).

View this message in context: http://free-pascal-general.1045716.n5.nabble.com/Suffix-Trie-implementation-please-review-tp4422708p4425751.html
Sent from the Free Pascal - General mailing list archive at Nabble.com.

More information about the fpc-pascal mailing list