The amount of updates will vary from time to time. Sometimes I imagine there
will be 200-300 records to update, but for the most time maybe 10-50
records.
The mathematical system I will create is in a way recursive... You check
Record #1 - how many records in the database has similar values. After this
you select Record #2, and determine how many records have similar values...
etc.etc.
I believe checking one record doesnt take a lot of time itself, but the
overhead time ('triggering' the process to load/activate the MySQLdeamon)
will be most of the 0.1 seconds.
Thanks for doing the test :)
Cheers
Rob
-----Mensagem original-----
De: Peter Lovatt [mailto:[EMAIL PROTECTED]]
Enviada em: domingo, 6 de outubro de 2002 18:57
Para: Robert H.R. Restad; [EMAIL PROTECTED]
Assunto: RE: Performance Question.
Hi
I am running php/mysql on 2x PIII 1 GHz / 512MB RAM / SCSI and can run
queries on datasets of 220,000
SELECT * FROM `Tablename` WHERE `Prod_code` LIKE 'A43611109%' in less time
than I can count (0.1 sec at a guess)
The insert/update bit is the bit which will dictate the speed - how many
records need updating?
HTH
Peter
-----------------------------------------------
Excellence in internet and open source software
-----------------------------------------------
Sunmaia
www.sunmaia.net
tel. 0121-242-1473
-----------------------------------------------
-----Original Message-----
From: Robert H.R. Restad [mailto:[EMAIL PROTECTED]]
Sent: 06 October 2002 14:36
To: [EMAIL PROTECTED]
Subject: Performance Question.
I am writing a serverside application in Java which needs to query/search
200 000 rows and update affected records once every 2 minutes.
As performance/speed is of importance here - and this Table only contains
5-10 Columns of Integer numbers, I figured that using a HEAP type of table
would be the fastest.. (right?)
The imaginary system this will run on, is a Dual CPU P4/1,5Ghz or similar
with 2Gb RAM.
Now, what I am curious to find out is... Does this amount of
searches/queries sound like 'unreasonable' for MySQL and/or HEAP tables for
the current system configuration?
As I've read about MySQL performance, it appears to me that the real drag is
usually disk-search. Now, the size of the database in my case is not an
issue, it will be constantly 200 000 rows, the only thing that will change
is the integer numbers stored. As far as I am concerned, that should mean I
would never need to access the disk at all (apart from when dumping this
table from memory to disk for the purpose of backups, of course)...
Anyone got a good tip for how to solve this issue to make sure I dont end up
with a database bottleneck in the system...
Cheers
Rob.
______________________________________________________
Se den nye Yahoo! Mail på http://no.yahoo.com/
Nytt design, enklere å bruke, alltid tilgang til Adressebok, Kalender og
Notisbok
---------------------------------------------------------------------
Before posting, please check:
http://www.mysql.com/manual.php (the manual)
http://lists.mysql.com/ (the list archive)
To request this thread, e-mail <[EMAIL PROTECTED]>
To unsubscribe, e-mail <[EMAIL PROTECTED]>
Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
______________________________________________________
Se den nye Yahoo! Mail på http://no.yahoo.com/
Nytt design, enklere å bruke, alltid tilgang til Adressebok, Kalender og Notisbok
---------------------------------------------------------------------
Before posting, please check:
http://www.mysql.com/manual.php (the manual)
http://lists.mysql.com/ (the list archive)
To request this thread, e-mail <[EMAIL PROTECTED]>
To unsubscribe, e-mail <[EMAIL PROTECTED]>
Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
