Re: [HACKERS] Terminology issue: suffix tree

2013-05-08 Thread Heikki Linnakangas
On 08.05.2013 15:49, Alexander Korotkov wrote: On Wed, May 8, 2013 at 3:50 PM, Heikki Linnakangas wrote: Yeah. The data structure in contrib/unaccent seems to be a plain old trie, rather than a radix trie, though. According to wikipedia at least, the difference is that in a radix tree, the edge

Re: [HACKERS] Terminology issue: suffix tree

2013-05-08 Thread Alexander Korotkov
On Wed, May 8, 2013 at 3:50 PM, Heikki Linnakangas wrote: > On 06.05.2013 14:10, Alexander Korotkov wrote: > >> On Sat, May 4, 2013 at 10:27 PM, Alexander Korotkov >> **wrote: >> >>> In suffix tree we insert every suffix of source string into the tree. >>> >>> http://en.wikipedia.org/wiki/**Suffix

Re: [HACKERS] Terminology issue: suffix tree

2013-05-08 Thread Heikki Linnakangas
On 06.05.2013 14:10, Alexander Korotkov wrote: On Sat, May 4, 2013 at 10:27 PM, Alexander Korotkovwrote: In suffix tree we insert every suffix of source string into the tree. http://en.wikipedia.org/wiki/Suffix_tree Actually opclass implemented radix tree or patricia tree. http://en.wikipedia.or