November 18, 2019 | San Diego, California
View More Details & Register Here
Back To Schedule
Monday, November 18 • 11:20am - 11:40am
A New Radix-Tree Based Memory Storage Engine - Mengran Wang, VMware

Sign up or log in to save this to your schedule, view media, leave feedback and see who's attending!

Feedback form is now closed.
This talk describes the development of a new FDB memory storage engine based on the radix tree data structure. The default memory storage engine is a balanced binary search tree. Because Wavefront’s use case involves a large amount of prefix-overlap in keys, we decided to adopt a different data structure, the radix tree, to make our FDB clusters more space-efficient. This trie-based KV store has two main advantages:
(1) It is more space-efficient than the default engine when there is a large amount of key overlap (as in our time series workloads).
(2) The height and complexity of a radix tree depend on the length of the keys, not on the number of elements

Our presentation will include a brief introduction to radix tries followed by a deep dive into some of the optimizations we needed to make. Finally, we will show the performance comparison results using real-life Wavefront workloads.


Mengran Wang

Member of Technical Staff, VMware
Mengran Wang is a software engineer at VMware, Wavefront team, a real-time metrics monitoring and streaming analytics platform. She’s working on Foundation DB related projects, primarily focus on memory storage engine optimization/development.  

Monday November 18, 2019 11:20am - 11:40am PST
Grand Ballroom 8
  FDB Internals
  • Session Slides Included Yes