The performance of the Haskell containers package

Authors:
Milan Straka
Affiliations:
Charles University in Prague, Prague, Czech Rep
Venue:
Proceedings of the third ACM Haskell symposium on Haskell
Year:
2010

Citing 6
Cited 1

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Purely Functional Data Structures

Purely Functional Data Structures
C--: A Portable Assembly Language that Supports Garbage Collection

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Finger trees: a simple general-purpose data structure

Journal of Functional Programming
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Adams' trees revisited: correctness proof and efficient implementation

TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we perform a thorough performance analysis of the containers package, the de facto standard Haskell containers library, comparing it to the most of existing alternatives on HackageDB. We then significantly improve its performance, making it comparable to the best implementations available. Additionally, we describe a new persistent data structure based on hashing, which offers the best performance out of available data structures containing Strings and ByteStrings.