MySQL Forums
Forum List  »  NDB clusters

Advanced Search
New Topic

Re: Index Search over 26 times slower than full table scan
Posted by: Christian Zintl
Date: July 06, 2014 04:31AM

No, analyzing and optimizing the table did not have any effect. The query takes 30 Seconds now, but that's probably due to the table being larger now or something - while the query with "ignore index" still takes .3 seconds.

But in general: shouldn't a BTREE index be faster than a full table scan, even for greater than / smaller than expressions?
The index would go down the tree until it finds the smallest or biggest entry that matches and then follow the tree down accordingly - or is "DATE" stored like a string, and not like a timestamp in mySQL?

Navigate: Previous Message• Next Message
Options: Reply• Quote


Subject
Views
Written By
Posted
Index Search over 26 times slower than full table scan
2285
Christian Zintl
June 08, 2014 09:28AM
Re: Index Search over 26 times slower than full table scan
999
Andrew Morgan
July 03, 2014 09:26AM
Re: Index Search over 26 times slower than full table scan
1069
Christian Zintl
July 06, 2014 04:31AM


Sorry, you can't reply to this topic. It has been closed.

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.