Why is MySQL nearly twice as fast on Linux?

[Ken Menzel]

Also note that InnoDB tables use a clustered index for the primary
key.  If you are using the primary key the data will be read at the
same time as the index when the correct node is located (Re: High
performance MySQL by Jeremy Zawodney and Derek Balling).  MyISAM
tables use btree's  in a separate file scanning the index then
starting a read of the data file at the appropriate disk location.
Primay key lookups with innodb should be faster and use less disk
seeking.
Hope this helps,
Ken
----- Original Message ----- 
From: "Petri Helenius" <pete at he.iki.fi>
To: "Thomas Hurst" <tom.hurst at clara.net>
Cc: <freebsd-threads at freebsd.org>
Sent: Monday, May 24, 2004 3:07 AM
Subject: Re: Why is MySQL nearly twice as fast on Linux?


> Thomas Hurst wrote:
>
> >
> >Only if you're only using one table.  While this is true in this
> >benchmark, it isn't really relevent because we're only testing
selects,
> >which are pure reads.  There should be no table locking getting in
the
> >way; Linux's performance would seem to confirm this.
> >
> >
> >
> I changed the test to use InnoDB table type and saw 50% performance
> improvement.
>
> Pete
>
>
> _______________________________________________
> freebsd-threads at freebsd.org mailing list
> http://lists.freebsd.org/mailman/listinfo/freebsd-threads
> To unsubscribe, send any mail to
"freebsd-threads-unsubscribe at freebsd.org"
>