Re: Full text indexing - Burrows-Wheeler + suffix arrays

From: Oleg Bartunov <oleg(at)sai(dot)msu(dot)su>
To: Lincoln Yeoh <lyeoh(at)pop(dot)jaring(dot)my>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: Full text indexing - Burrows-Wheeler + suffix arrays
Date: 2002-12-10 10:15:44
Message-ID: Pine.GSO.4.44.0212101312070.5734-100000@ra.sai.msu.su
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Yes, I've read it and have corresponded with Paolo Ferragina.
Most interesting is String B-Tree data structure
(http://butirro.di.unipi.it/~ferrax/papers.html)
I hope we could try something in next year, this year we're too busy.

Oleg

On Tue, 10 Dec 2002, Lincoln Yeoh wrote:

> Has anyone seen this?
>
> http://butirro.di.unipi.it/~ferrax/fmindex/index.html
>
> Involves using the Burrows-Wheeler transform and suffix arrays.
>
> Seems interesting. Not sure about licensing/patent issues though. Still, a
> different method using similar ideas might work better for RDBMS situations.
>
> Cheerio,
> Link.
>
>
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 6: Have you searched our list archives?
>
> http://archives.postgresql.org
>

Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Magnus Naeslund(f) 2002-12-10 10:16:27 Re: MD5 passwords explained (was Re: md5 hash question (2))
Previous Message Çağıl Şeker 2002-12-10 10:06:26 Re: MD5 passwords explained (was Re: md5 hash question (2))