: news from MySQL
Hi,
I just seen this and I'm sure that there are many MySQL freaks here that
would
be delighted about this...
http://www.mysql.com/press/release_2003_05.html
Long live and happiness.. (which means in my language - bed time)
Hetz
Indeed good news though they have long way till they match
with postgres.
and postgres still has a long way till they match with oracle.
My choice and recommendation: PostgreSQL.
I might choose mysql for building really simple sites with
simple queries
Does PostgreSQL match up
Ben-Nes Michael wrote:
Indeed good news though they have long way till they match with postgres.
and postgres still has a long way till they match with oracle.
PostgreSQL also has a long way till matching with MySQL's popularity.
My choice and recommendation: PostgreSQL.
Agreed.
By the
Title: RE: news from MySQL
-Original Message-
From: Eli Marmor [mailto:[EMAIL PROTECTED]]
By the way: What is the list's recommendation for a database for a
dictionary? (i.e. zillion records; English words are the keys; 99% of
the activity is search and read and almost
Boulgakov Andrei wrote:
By the way: What is the list's recommendation for a database for a
dictionary? (i.e. zillion records; English words are the keys; 99% of
the activity is search and read and almost no update activity; When
matching texts against the DB, the length is not known, and
And a similar question: If I have a collection of hundreds (simple)
regular expressions, and want to find all the matches of them in a long
free text, is there any Open Source library for this purpose? (like
flex, but without generating C code + compilation to machine code; Just
a function
Oleg Kobets wrote:
And a similar question: If I have a collection of hundreds (simple)
regular expressions, and want to find all the matches of them in a long
free text, is there any Open Source library for this purpose? (like
flex, but without generating C code + compilation to machine
Quoting Eli Marmor, from the post of Wed, 22 Jan:
By the way: What is the list's recommendation for a database for a
dictionary? (i.e. zillion records; English words are the keys; 99% of
Berkeley DB?
Actually, the records are stored currently in Berkeley DB...
:-)
In the
On Wed, 22 Jan 2003, Eli Marmor wrote:
By the way: What is the list's recommendation for a database for a
dictionary? (i.e. zillion records; English words are the keys; 99% of
the activity is search and read and almost no update activity; When
matching texts against the DB, the length is not
Ira Abramov wrote:
not a free solution, but look at CDB from DJB:
http://cr.yp.to/cdb.html
:-)
Last answers (yours and Tzafrir's) are getting more and more closer to
my purpose, so I guess that my original question was not phrased well,
and my last post helped to make it clearer.
I saw
Title: RE: news from MySQL
-Original Message-
From: Eli Marmor [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, January 22, 2003 1:10 PM
To: Linux-IL
Subject: Re: news from MySQL
My question was confusing, so I want to add the following:
I'm talking about in-memory database (I
On Wed, Jan 22, 2003, Eli Marmor wrote about Re: news from MySQL:
Of course. Use perl. It is perfect for such things and as you probably know
has a very strong regexps :-)
..
In my original post, I also mentioned the critical need for efficiency.
Perl (including compiled Perl), not only
Nadav Har'El wrote:
Kernigan and Pike in their relatively-new book The Practice of programming
give an example very similar to yours, as an example of choosing good
algorithms. Their example involves a spam filter, which takes a given
message and needs to check whether a large number of
On Wed, Jan 22, 2003, Eli Marmor wrote about Re: news from MySQL:
Kernigan and Pike in their relatively-new book The Practice of programming
give an example very similar to yours, as an example of choosing good
On behalf of Amazon, I want to thank you for the reference!
:)
This book
On Wed, 22 Jan 2003 12:22:09 +0200
Eli Marmor [EMAIL PROTECTED] wrote:
By the way: What is the list's recommendation for a database for a
dictionary? (i.e. zillion records; English words are the keys; 99% of
the activity is search and read and almost no update activity; When
matching texts
Hi everybody. Been lurking for a while, nice to meet you all.
How simple is simple?
If it's as simple as fragments of words, and your text is really long,
and doesn't change, you'll want to index the text in advance, to speed
the searches. For this case, suffix trees or suffix arrays are very
Hi,
I just seen this and I'm sure that there are many MySQL freaks here that would
be delighted about this...
http://www.mysql.com/press/release_2003_05.html
Long live and happiness.. (which means in my language - bed time)
Hetz
17 matches
Mail list logo
