Question

Background: I have a table with 5 million address entries which I’d like to search for different fields (customer name, contact name, zip, city, phone, …), up to 8 fields. The data is pretty stable, maximum 50 changes a day, so almost only read access.

The user isn’t supposed to tell me in advance what he’s searching for, and I also want support of combined search (AND-concatenation of search terms). For example “lincoln+lond” should search for all records containing both search terms in any of the search fields, also those entries starting with any of the terms (like “London” in this example).

Problem: Now I need to choose an indexing strategy for this search table. (As a side note: I’m trying to achieve sub-second response time, worst response time should be 2 seconds.) What’s better in terms of perfomance:

1. Do a combined index out of all queryable columns (would need 2 of them, as index limit of 900 bytes reached)
2. Put single indexes on each of the queryable columns
3. Make a fulltext index on the queryable columns and use fulltext query

I’m discarding point 1, as it doesn’t seem to have any advantage (index usage will be limited and there will be no “index seek”, because not all fields fit in one single index).

Question: Now, should I use the multiple single indexes variant or should I go with the fulltext index? Is there any other way to achieve the functionality mentioned above?

Answer 1

To answer my own question:

I’ve chosen the “multiple single indexes” option. I ended having an index for each of the queried columns, each index containing only the column itself. The search works very good with mostly subsecond response times. Sometimes it takes up to 2-3 seconds, but I’m attributing it to my database server (several years old laptop with 3GB Ram and slow disk).

I didn’t test the fulltext option as it was not anymore necessary (and I don’t have the time to do it.)