An interesting read on implementing some data structures

[Tommi Prami 130]

Yellow,

 

Never pondered what happen when memory gets fragmented. Bit hard to test maybe. But if there would be easy way, could give good info of performance when environment is in challenging state.

 

https://johnnysswlab.com/faster-hash-maps-binary-trees-etc-through-data-layout-modification/

 

-Tee-

[Stefan Glienke 2002]

Anyone serious about implementing any data structures that require heap allocation should consider some sort of suballocation pattern to avoid or mitigate memory fragmentation.

Also, there is a reason why things like rebuilding indexes exist in databases.

Edited October 4, 2023 by Stefan Glienke