A lot of table scans do to bitmasked column values. So
SELECT * FROM search_table where .... AND colN & 4; Such that the above query will not utilize a key. I was told at the last convention that mySQL had some good ideas on allowing indexes for bitwise (arithmetic) columns but they are not quite there yet. It's a hard problem I can only think of a way by having every possible bit in an index but then that makes the index useless. -->-----Original Message----- -->From: Steven Roussey [mailto:[EMAIL PROTECTED] -->Sent: Wednesday, June 18, 2003 12:59 PM -->To: 'Mysql' -->Subject: RE: RAID hardware suggestions/experience --> -->---- -->2 x 2.8 GHZ Xeon -->4 GB of RAM -->5 15K SCSI Drives -->ICP SCSCI RAID control card with 1 Gb of ram on it. -->I just bought 30 of these boxes to build out my mysql farm for close to -->400-600 queries a second with 60 connections a second of mix read / -->writes. -->---- --> -->What kind of queries are you doing? Our simple dual Athlon, with -->software RAID and the disks I mentioned before does 3000+ queries a -->second. I've pushed it to 8000 before, but it got too slow for me. 60/40 -->read/write. --> -->-steve- --> --> -->-- -->MySQL General Mailing List -->For list archives: http://lists.mysql.com/mysql -->To unsubscribe: -->http://lists.mysql.com/[EMAIL PROTECTED] -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
