Corpus ID: 42741392

A Mergeable Interval Map

@article{Bonichon2011AMI,
  title={A Mergeable Interval Map},
  author={Richard Bonichon and Pascal Cuoq},
  journal={Stud. Inform. Univ.},
  year={2011},
  volume={9},
  pages={5-37}
}
  • Richard Bonichon, Pascal Cuoq
  • Published 2011
  • Computer Science
  • Stud. Inform. Univ.
  • This article describes an efficient persistent mergeable data structure for mapping intervals to values. We call this data structure rangemap. We provide an example of application where the need for such a data structure arises (abstract interpretation of programs with pointer casts). We detail different solutions we have considered and dismissed before reaching the solution of rangemaps. We show how they solve the initial problem and eventually describe their implementation. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES
    Fast Mergeable Integer Maps
    • 58
    • Highly Influential
    • PDF
    The Zipper
    • 310
    • Highly Influential
    • PDF
    Finger trees: a simple general-purpose data structure
    • 93
    • PDF
    Type-safe modular hash-consing
    • 66
    • PDF
    Graph-Based Algorithms for Boolean Function Manipulation
    • 7,108
    • PDF
    Diets for Fat Sets
    • 9
    • PDF
    PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
    • 921
    • PDF
    AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION
    • 583