Re: like and match in blobs

Posted in 2000

Obnoxio The Clown — Mon, 07 Aug 2000 15:35:22 BST — source: Informix-list mailing list archive (1991-1998)

From: Thomas Parsli <thomas.parsli@startsiden.no> > >"Obnoxio The Clown" <obnoxio@hotmail.com> writes: > > > From: "Martin A. Marques" <martin@math.unl.edu.ar> > > > > > >I would like to have some thoughts on how informix ODS 7.30 would work >on > > >Solaris for Intel making searchs of text strings inside blobs (text). > > >I would like to know how the performance is, because I was told that >the > > >DataBase servers (almost any) don't work well when looking for >substrings > > >in > > >large pieces of text. > > > > IDS.2000, Verity text search datablade. Whizzo! > >More whizzo than Excalibur? More whizzo in that it's likely to be around longer. Allegedly. ________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com

↪ replying to Obnoxio The Clown

Thomas Parsli — 08 Aug 2000 10:33:20 +0200 — source: Informix-list mailing list archive (1991-1998)

"Obnoxio The Clown" <obnoxio@hotmail.com> writes: > From: Thomas Parsli <thomas.parsli@startsiden.no> > > > >"Obnoxio The Clown" <obnoxio@hotmail.com> writes: > > > > > From: "Martin A. Marques" <martin@math.unl.edu.ar> > > > > > > > >I would like to have some thoughts on how informix ODS 7.30 would work > >on > > > >Solaris for Intel making searchs of text strings inside blobs (text). > > > >I would like to know how the performance is, because I was told that > >the > > > >DataBase servers (almost any) don't work well when looking for > >substrings > > > >in > > > >large pieces of text. > > > > > > IDS.2000, Verity text search datablade. Whizzo! > > > >More whizzo than Excalibur? > > More whizzo in that it's likely to be around longer. Allegedly. Ah, but then we'd all bu using Oracle -wouldn't we? Thomas