Now the idea behind weighted search is nice, but it is complicated, requires several extra calculation steps, and can cause other issues.
In a Database, you might have heard about indexing. The idea of finding a way to store a subset of your table which means faster searching. Of course, if you are looking through a long list of names, it may not work.
On the other hand, you can use an index to calculate a value and jump closer to the search result, much like a hashing table.
This is in portion, why indexing makes our database grow, it has to store additional data to make the table data faster, but it is faster. Much faster. I’ve personally seen searches go from 15+ minutes down to a few seconds because of indexing the data.
Depending upon the amount of data you have, and how you need to proceed, you may want to look as a hashing algorithm, or a n-node tree to more efficiently search through data.
As you can jump closer to the specific spot, your applications speed will dramatically improve.
Searching Indexs was originally found on Access 2 Learn
