k-dLst Tree: k-d Tree with Linked List to Handle Duplicate Keys

Abstract

Spatial data can be indexed in many ways like indexing of points, lines, and polygons. And, there are many indexing structures like R-tree, k-d tree, grids, and their variants, which are used for indexing geospatial data. The fundamental type of the k-d structure is used to index k-dimensional data. Every interior node of the k-d structure holds a data coordinate and represents a rectangular area. Root of the k-d tree structure represents the whole area of interest. The k-d tree is a main memory structure. Though the main memory methods are not designed to handle very large datasets, these data structures show many interesting features for handling spatial data. The spatial datasets might have several records for the same spatial location. In this paper, we are proposing the novel indexing structure k-dLst tree to index the spatial records with duplicate keys. The proposed indexing tree is based on k-d tree indexing structure.