Curious , what are your thoughts on:
The String B-Tree: A New Data Structure for
String Search in External Memory
http://citeseer.nj.nec.com/ferragina98string.html
or
Suffix Binary Search Trees And Suffix Arrays
http://citeseer.nj.nec.com/irving01suffix.html
TnksAmancio
-----Original Message-----
From: Oleg Bartunov [mailto:oleg@sai.msu.su]
Sent: Tuesday, August 06, 2002 11:25 AM
To: Amancio Hasty, Jr
Cc: pgsql-hackers@postgresql.org
Subject: Re: [HACKERS] tsearch -- regular expressions?
On Mon, 5 Aug 2002, Amancio Hasty, Jr wrote:
> I am wondering if the contrib module tsearch supports reqular expressions
currently no. I'd imagine we could add support of LIKE to tsearch but
without index support
> and
> if it has any kind of indexing over the stored text data like for instance
> a suffix trie?
no, suffix trie is not a balanced tree, while GiST is a height balanced.
>
> Tnks
> Amancio
>
>
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 1: subscribe and unsubscribe commands go to majordomo@postgresql.org
>
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
