SQLScholar
Programmer
Hi all,
We have a table - which is starting to get big, quickly. Someone in the team i work in had the idea to split the table in bits (so maybe 2005,2006,2007)
It was said that if the data was split (rather then just leaving it in one table, and forcing the end user to chose a year - so that less data was returned) the speed would be quicker, as the index would be smaller?
Is this true?
Thanks
Dan
----------------------------------------
Be who you are and say what you feel, because those who mind don't matter and those who matter don't mind - Dr. Seuss
Computer Science is no more about computers than astronomy is about telescopes - EW Dijkstra
----------------------------------------
We have a table - which is starting to get big, quickly. Someone in the team i work in had the idea to split the table in bits (so maybe 2005,2006,2007)
It was said that if the data was split (rather then just leaving it in one table, and forcing the end user to chose a year - so that less data was returned) the speed would be quicker, as the index would be smaller?
Is this true?
Thanks
Dan
----------------------------------------
Be who you are and say what you feel, because those who mind don't matter and those who matter don't mind - Dr. Seuss
Computer Science is no more about computers than astronomy is about telescopes - EW Dijkstra
----------------------------------------