Re:Why databases use ordered indexes but programming uses ha...
by dajohnson89 on Monday December 09, 2019 @11:23PM
(#21749565)
of the data structures you mentioned, which are easier to work with? to implement? I code in Java and I usually use hashmaps as a go to. they're simple and fast ways to store relationships between data.
[ Parent
| on HN ]
Re:Why databases use ordered indexes but programming uses ha...
by garmaine on Tuesday December 10, 2019 @12:28AM
(#21749845)
std::map in C++ is way easier to work with than std::unordered_map (which didn't even exist until C++11).
Re:Why databases use ordered indexes but programming uses ha...
by yuushi on Tuesday December 10, 2019 @01:31AM
(#21750202)
Define "way easier". The interface, at least for day to day operations, is basically identical.
Re:Why databases use ordered indexes but programming uses ha...
by garmaine on Tuesday December 10, 2019 @05:19AM
(#21751237)
Supports more features like ordered traversal, generally faster in most cases (yup!), consistent api cost, doesn’t invalidate iterators on certain operations like moving between maps. That’s just off the top of my head.