Segmented Iterators and Hierarchical Algorithms

Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unnecessarily inefficient. A new kind of abstraction, in which segmentation is explicit, makes it possible to write hierarchical algorithms that exploit segmentation.

• Type: Conference
• Year: 1998
• Where: DAGSTUHL
• Authors: Matthew H. Austern
• Keywords: DAGSTUHL 1998, DAGSTUHL 2007, Data Structure, Many Data Structures, Uniform Range