4 ms·
Is this like the mm/dd/yyyy date problem, where ideally names would be ordered from the most general part to the most specific?
by mbg721 4y ago
Is this like the mm/dd/yyyy date problem, where ideally names would be ordered from the most general part to the most specific?
- Comevius 4y agoExactly. With a proper lexical order you can search efficiently. A composite index that starts with a month would be useful for finding entries with the given month, but usually we want to find entries recursively, starting with a year, then the month, then the day, if necessary, as at that point we may have already found what we are looking for.