Improved Bulk-Loading Algorithms for Quadtrees

Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we report recent improvements in bulk-loading PMR quadtrees, which index arbitrary spatial objects, and present a new algorithm for bulk-loadingPR quadtrees, which index point data. Our algorithms assume that the quadtree is implemented using a linear quadtree, a disk-resident representation that stores objects contained in the leaf nodes of the quadtree in a linear index (e.g., a Btree) ordered on the basis of a space-filling curve. We show with experiments that our algorithms yieldsignificant performance improvements for bulk-loading quadtrees.

• Type: Conference
• Year: 1999
• Where: GIS
• Authors: Gísli R. Hjaltason, Hanan Samet
• Keywords: Arbitrary Spatial Objects, Automated Reasoning, GIS 1999, Pmr Quadtrees, Spatial