The most commonly used map (dictionary) data type in Haskell is implemented using a size balanced tree. While size balanced trees provide good asymptotic performance, their real world performance is not stellar, especially when used with keys which are expensive to compare, such as strings.
In this talk we will look at two different map implementations that use hashing to achieve better real world performance. The implementations have different performance characteristics: one provides very fast look-ups while the other trades better insert performance for somewhat slower look-ups. I will describe the design of these data structures and show some early benchmark results.
Johan Tibell is a Software Engineer at Google Inc. He received a M.S. in Software Engineering from Chalmers University of Technology, Sweden, in 2007.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?