Master’s Thesis Presentation • Algorithms and Complexity • Extremely Fast (a,b)-trees at all Contention Levels
Please note: This master’s thesis presentation will be given online.
Anubhav Srivastava, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Trevor Brown
The ordered dictionary is one of the most fundamental abstract data types. It stores a set of key-value pairs, and supports operations to insert, remove and retrieve key-value pairs. It can also support range query operations.