Re:SQLite 3.8.0 Release with next-generation query planner
by ww520 on Tuesday August 27, 2013 @03:16AM
(#6281961)
Just curious, what database is that? If the index on id is a B+ tree rather than a hashtable, it's very unlikely id > 100 would be slower. You are issuing one query with it vs. N queries with the 2nd approach.
Were there a lot of qualified rows for id > 100? If there're a million rows qualified for id > 100, which way is faster?
Were there a lot of qualified rows for id > 100? If there're a million rows qualified for id > 100, which way is faster?