I have some observation which I am not able to explain. So, I have a table (Table B) in which I want to apply filters on two columns. and values in these columns are derived from another table (Table A), after applying some filter based on user input Assume all tables to have 1million+ rows.
Now, based on the size of Table A, some time INNER Joins are faster and some time IN query is faster. And, both the columns are indexed and contain string values.
How can I ensure that query that I write is faster for both smaller data in Table A and Large data in TableA after applying filters.
Very interesting.
wonderful post! Learnt lot about the internal processes
Happy to see this!!
It's amazing and resourceful
thanks :)
Wow, very helpful for a developer to know the internals
Yes :)
What a great post! Was not expecting to be learning the postgres internals this morning, super happy I did!
Thanks a lot Cesar!
Awesome write up… insightful.. thanks!
Thanks for this wonderful write-up.
I have some observation which I am not able to explain. So, I have a table (Table B) in which I want to apply filters on two columns. and values in these columns are derived from another table (Table A), after applying some filter based on user input Assume all tables to have 1million+ rows.
Now, based on the size of Table A, some time INNER Joins are faster and some time IN query is faster. And, both the columns are indexed and contain string values.
How can I ensure that query that I write is faster for both smaller data in Table A and Large data in TableA after applying filters.