A Framework for Index Bulk Loading and Dynamization

Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in Rd . Well-known examples of wp-trees include kd-trees, BBD-trees, pseudoquad-trees, and BAR-trees. Given an efficient external wp-tree construction algorithm, we present a general framework for automatically obtaining a dynamic external data structure. Using this framework together with a new general construction (bulk loading) technique of independent interest, we obtain data structures with guaranteed good update performance in terms of I/O transfers. Our approach gives considerably improved construction and update I/O bounds for e.g. external kd-trees and BBD-trees.

• Type: Conference
• Year: 2001
• Where: ICALP
• Authors: Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
• Keywords: Data Structures, External Wp-tree Construction, ICALP 2001, Memory Data Structures, Programming Languages