Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-27T12:03:28.358Z Has data issue: false hasContentIssue false
  • English
  • Français

Deletion: The curse of the red-black tree

Part of: JFP Functional Pearls

Published online by Cambridge University Press:  11 September 2014

KIMBALL GERMANE  and
MATTHEW MIGHT
KIMBALL GERMANE
Affiliation:
University of Utah, UT, USA (e-mail: krgermane@gmail.com)
MATTHEW MIGHT
Affiliation:
University of Utah, UT, USA (e-mail: krgermane@gmail.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Okasaki introduced the canonical formulation of functional red-black trees when he gave a concise, elegant method of persistent element insertion. Persistent element deletion, on the other hand, has not enjoyed the same treatment. For this reason, many functional implementations simply omit persistent deletion. Those that include deletion typically take one of two approaches. The more-common approach is a superficial translation of the standard imperative algorithm. The resulting algorithm has functional airs but remains clumsy and verbose, characteristic of its imperative heritage. (Indeed, even the term insertion is a holdover from imperative origins, but is now established in functional contexts. Accordingly, we use the term deletion which has the same connotation.) The less-common approach leverages the features of advanced type systems, which obscures the essence of the algorithm. Nevertheless, foreign-language implementors reference such implementations and, apparently unable to tease apart the algorithm and its type specification, transliterate the entirety unnecessarily. Our goal is to provide for persistent deletion what Okasaki did for insertion: a succinct, comprehensible method that will liberate implementors. We conceptually simplify deletion by temporarily introducing a “double-black” color into Okasaki's tree type. This third color, with its natural interpretation, significantly simplifies the preservation of invariants during deletion.

Type
Functional Pearl
Information
Journal of Functional Programming , Volume 24 , Issue 4 , July 2014 , pp. 423 - 433
Copyright
Copyright © Cambridge University Press 2014 

References

Appel, A. W. (2011) Efficient verified red-black trees.Google Scholar
Appel, A. & MacQueen, D. (1991) Standard ml of new jersey. In Programming Language Implementation and Logic Programming. Springer, pp. 1–13. Springer Berlin Heidelberg.Google Scholar
Bertot, Y. & Castéran, P. (2004) Interactive Theorem Proving and Program Development: Coq'art: the Calculus of Inductive Constructions. Springer. Springer-Verlag Berlin Heidelberg.CrossRefGoogle Scholar
Cormen, T. H., Leiserson, C. E., Rivest, R. L. & Stein, C. (2001) Introduction to Algorithms, vol. 2. The MIT press Cambridge. The MIT Press Cambridge.Google Scholar
Dybvig, R. K. (2003) The Scheme Programming Language. The MIT Press. The MIT Press Cambridge.Google Scholar
Filliâtre, J.-C. & Letouzey, P. (2004) Functors for proofs and programs. In Programming languages and systems. pp. 370–384.Google Scholar
Flatt, M. & PLT. (2010) Reference: Racket. Tech. rept. http://racket-lang.org/tr1/.Google Scholar
Hinze, R. et al. (1999) Constructing red-black trees. In Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, vol. 99, pp. 89–99.Google Scholar
Huet, G. (1997) The zipper. J. Funct. Program. 7 (05), 549–554.Google Scholar
Kahrs, S. (2001) Red-black trees with types. J. Funct. Program. 11 (04), 425–432.Google Scholar
Odersky, M. (2009) The scala language specification, version 2.8. Epfl lausanne, switzerland.Google Scholar
Okasaki, C. (1999) Red-black trees in a functional setting. J. Funct. Program. 9 (04), 471–477.Google Scholar
Peyton Jones, S. (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.