The Slab List is new multipurpose data structure designed with extreme memory efficiency in mind — increasingly, especially in the cloud, RAM is money. The Slab List can fulfill multiple roles: it can keep the data either sorted or unsorted. Other data structures used in the same roles, such as AVL Trees and Linked Lists, use 5 times and 2 time the RAM, respectively. The performance of insertions and deletions is about the same all across the board. Naturally these are just some sample statistics, and a more detailed analysis can be found in the posts.
Its reference implementation is hosted on github.