> I hear what you're saying about memory, but I really don't understand why a > btree lookup would be so dramatically slow compared to a linear search with > grep. Would something other than MyISAM be more appropriate here?
If you feel that a linear search is faster, why not try to let MySQL IGNORE INDEX(PRIMARY): SELECT * FROM table IGNORE INDEX(PRIMARY) WHERE ...; If you do an EXPLAIN of such a query it should state that NULL index was used, etc. Regards, Jigal. -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
