Figure H-11 summarizes the techniques for maintaining ordered flat files. Three supporting data struc-tures are possible. Sequential lists can be used, but the data must be duplicated in order to maintain several orders. Because sequential lists are not used in database processing, we will not consider them further. Both linked lists and indexes can be used without data duplication. B-trees are special applica-tions of indexes.