As things stand, the table classics works and can be searched without problem by MySQL\u2014until it grows to more than a couple of hundred rows. At that point, database accesses will get slower and slower with every new row added, because MySQL has to search through every row whenever a query is issued. This is like searching through every book in a library whenever you need to look something up. <\/p>\n\n\n\n
Of course, you don\u2019t have to search libraries that way, because they have either a card index system or, most likely, a database of their own. And the same goes for MySQL, because at the expense of a slight overhead in memory and disk space, you can create a \u201ccard index\u201d for a table that MySQL will use to conduct lightning-fast searches.<\/p>\n","protected":false},"excerpt":{"rendered":"
As things stand, the table classics works and can be searched without problem by MySQL\u2014until it grows to more than a couple of hundred rows. At that point, database accesses will get slower and slower with every new row added, because MySQL has to search through every row whenever a query is issued. This is … Continue reading Indexes<\/span>