3 ms·
> 2 Questions! What's the index data structure that holds old enum values even after the value itself is not used anymore? It's not that index structure specif
by anarazel 9y ago
> 2 Questions! What's the index data structure that holds old enum values even after the value itself is not used anymore?
It's not that index structure specific atm, even though it could possibly be avoided for some types (e.g. hash, although there's considerable visibility issues to make that possible). Consider e.g. a btree index, if the deleted enum value ends up in an inner page, you really need to know how it compares to know where to descend to.
> Secondly, what are your thoughts on using enum generally? Would you recommend them in cases where you don't need to really optimise for narrower columns?
I like using them. There's cases where the transactional restrictions make it too problematic, but other than that I think the documentational advantage is substantial, besides just the width.