On Fri, 19 Nov 2004, Troels Arvin wrote:
> Hello Oleg,
>
> On Fri, 2004-11-19 at 15:35 +0300, Oleg Bartunov wrote:
>
>> your project looks very attractive.
>
> Thanks.
>
>> In principle, suffix array should be implemented using GiST framework.
>
> But in a previous conversation between the two of us, you wrote that the
> GiST wasn't suitable for this problem? I would very much like to use GiST
it's still true :( some problem with my english grammar.
> instead of having to create a whole new index infrastructure (if that's
> the alternative).
>
>> String Btree should be very useful for your problem.
>
> I thought that string b-trees were only usable for texts with natural
> stops (word boundaries), as opposed to very long, contiguous sequences. Am
> I mistaken?
>
I meant SB-Tree by Paolo Ferragina
http://citeseer.ist.psu.edu/ferragina98string.html
>
Regards, Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83
