[SERVER-511] "hash" index Created: 31/Dec/09 Updated: 06/Dec/22 Resolved: 08/Feb/19 |
|
| Status: | Closed |
| Project: | Core Server |
| Component/s: | Index Maintenance |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | New Feature | Priority: | Minor - P4 |
| Reporter: | Eliot Horowitz (Inactive) | Assignee: | Backlog - Query Team (Inactive) |
| Resolution: | Won't Fix | Votes: | 7 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||||||
| Assigned Teams: |
Query
|
||||||||||||
| Participants: | |||||||||||||
| Description |
|
hash keys in btree to 10 bytes it may be bettter to just make hash keys more compressed / efficient instead. |
| Comments |
| Comment by Brian Lane [ 08/Feb/19 ] |
|
Closing this as won't fix for now. -Brian |
| Comment by Andrew Armstrong [ 09/Dec/10 ] |
|
MySQL can do prefix compression of keys as a way to shrink the size of indexes (especially on compound indexes), see http://dev.mysql.com/doc/refman/5.0/en/key-space.html for more info, which may be a suitable alternative. |
| Comment by Dwight Merriman [ 31/Dec/09 ] |
|
this would not support range queries (just lookups of a particular value), but might then take half the ram and half the cpu |