Timeline for Efficiently finding distinct values
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2012 at 21:17 | comment | added | Bob Jansen | In this case this solution has the added benefit that it's much more efficient if there is only a sorted index on (month, year, number) instead of a unique constraint. Of course YMMV. | |
| Jan 24, 2012 at 15:33 | comment | added | Leigh Riffel | @Jack Good question, I don't know. | |
| Jan 24, 2012 at 15:04 | comment | added | Jack Douglas |
Much easier to understand, +1. Is there any danger of the CBO rewriting as a hash/merge semi-join? It never seems to do anything like that with a subquery in the select.
|
|
| Jan 24, 2012 at 14:50 | history | edited | Leigh Riffel | CC BY-SA 3.0 |
added 4 characters in body
|
| Jan 24, 2012 at 14:42 | history | answered | Leigh Riffel | CC BY-SA 3.0 |