Search Speed: Records vs. Full Text Search

If the data can be divided into records, hash table based lookup is more than twice faster than Boyer-Moor-Horspool style full string search.

Example: QMap/QHash vs. QString::indexOf()