A general technique for managing strings in comparison-driven data structures

This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons, into a data structure D' that handles unbounded-length keys whose comparison cost is not a constant