| List: | General Discussion | « Previous MessageNext Message » | |
| From: | Rik Wasmus | Date: | October 11 2011 12:40pm |
| Subject: | Re: Index question | ||
| View as plain text | |||
> Next question. If you have the two separate indexes and then do two > queries, one for a and one for b. If you then get a list of unique id's > of both, would it be faster to create an intersection yourself rather > than have the server do the legwork? If you only have 2 unrelated indexes on a & b, it depends on the data, the distribution of values, etc. No single answer here, test with your data and you'll have the results. If you need it often, I'd go for the combined index & let MySQL do the work, which is probably fastest. -- Rik Wasmus
| Thread | ||
|---|---|---|
| • Index question | Alex Schaft | 11 Oct |
| • Re: Index question | Johan De Meersman | 11 Oct |
| • Re: Index question | Neil Tompkins | 11 Oct |
| • Re: Index question | Rik Wasmus | 11 Oct |
| • Re: Index question | Alex Schaft | 11 Oct |
| • Re: Index question | Alex Schaft | 11 Oct |
| • Re: Index question | Rik Wasmus | 11 Oct |
| • Re: Index question | Neil Tompkins | 11 Oct |
| • Re: Index question | Rik Wasmus | 11 Oct |
| • Re: Index question | Johan De Meersman | 11 Oct |
| • Re: Index question | Tompkins Neil | 11 Oct |
| • Re: Index question | Johan De Meersman | 12 Oct |
| • Re: Index question | Arthur Fuller | 11 Oct |
