larger ones-generally. Additionally more of the
> > >key_buffer can be used for tables with the most hits over the tables
> > >with less hits, making the lookup sustain speed over time.
> > >
> > >
> > >
> > >
> > >
> > >>--
rally. Additionally more of the
> >key_buffer can be used for tables with the most hits over the tables
> >with less hits, making the lookup sustain speed over time.
> >
> >
> >
> >
> >
> >>-Original Message-
> >>From: Dan Salzer
ss hits, making the lookup sustain speed over time.
-Original Message-
From: Dan Salzer [mailto:[EMAIL PROTECTED]
Sent: Wednesday, May 11, 2005 11:46 AM
To: mysql@lists.mysql.com
Subject: Union Performance Question
Hi everyone,
I have a question regarding the performance of UNION querie
Message-
> From: Dan Salzer [mailto:[EMAIL PROTECTED]
> Sent: Wednesday, May 11, 2005 11:46 AM
> To: mysql@lists.mysql.com
> Subject: Union Performance Question
>
> Hi everyone,
>
> I have a question regarding the performance of UNION queries:
>
> I need to do a full
Hi everyone,
I have a question regarding the performance of UNION queries:
I need to do a full-text search against a large number of rows. Is it
faster to have one table with 10,000,000 text rows and perform one
full-text search. Or, am I better off having 10 smaller more managable
tables and per
