How I slashed a SQL query's runtime with two Unix commands
1–10 of 91 posts
Re: How I slashed a SQL query's runtime with two Unix commands
#2Re: How I slashed a SQL query's runtime with two Unix commands
#3Try a real analytical database such as Vertica
Re: How I slashed a SQL query's runtime with two Unix commands
#4Re: How I slashed a SQL query's runtime with two Unix commands
#5The question im interested in is why MySQL did not use the index for the lookup.
With 5bn+ rows and a memory constraint, the type of index begins to make a difference - e.g. in Postgres I would have tried using a bloom index.
Re: How I slashed a SQL query's runtime with two Unix commands
#6Re: How I slashed a SQL query's runtime with two Unix commands
#7Re: How I slashed a SQL query's runtime with two Unix commands
#8The question im interested in is why MySQL did not use the index for the lookup.
Re: How I slashed a SQL query's runtime with two Unix commands
#9Re: How I slashed a SQL query's runtime with two Unix commands
#10The question im interested in is why MySQL did not use the index for the lookup.
Not sure if MySQL is the same but Postgres won't use an index if the statistics suggest doing so will be slower than a full table scan - would expect MySQL to be similar. With 5bn+ rows and a memory constraint, the type of index begins to make a difference - e.g. in Postgres I would have tried using a bloom index.