I have a quick lookup table of about 500,000 records.
The table consists of just 3 fields medium int fields, and indexed on just
one of them - So the records are small, as is the index.
The data won't have any inserts/updates throughout the day, and will be
built once a day. It's not a problem if the data is lost (server falling
over), as it can be rebuilt within 5 mins.
I need to get the most screamingly fast performance from the lookup of this
table (all selects will be "=" matches using the index)
Do I use HEAP tables - benefitting from hashed indexes and always in memory.
Or..
Do I use pack_isam and compress a plain ISAM/MyISAM table ? - benefitting
from being memory mapped and using less memory (am I right?)
There is oodles of spare memory currently (well, about 256MB spare)
System specs: Dual P3 750, running BSDI 4.0 and 512Mb RAM
---------------------------------------------------------------------
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
