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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Otair M (2013) Approximate K-nearest neighbour based spatial clustering using K-D tree. Int J Database Manag Syst (IJDMS) 5(1)
Bentley JL (1975) Multidimensional binary search trees used for associative searching. commun ACM 18:509–517
Crespo MM (2010) Design, analysis and implementation of new variants of Kd-trees. Master thesis, Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya
Brown RA (2015) Building a balanced k-d tree in O(kn log n) time. J Comput Graph Tech (JCGT) 4(1):50–68
Friedman JH, Bentley JL, Finkel RA (1977) ACM Trans Math Softw 209–226
https://www.cs.cmu.edu/~ckingsf/bioinfo-lectures/kdtrees.pdf (n.d.)
https://www.cs.umd.edu/class/spring2002/cmsc420-0401/pbasic.pdf (n.d.)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Meenakshi, Gill, S. (2019). k-dLst Tree: k-d Tree with Linked List to Handle Duplicate Keys. In: Rathore, V., Worring, M., Mishra, D., Joshi, A., Maheshwari, S. (eds) Emerging Trends in Expert Applications and Security. Advances in Intelligent Systems and Computing, vol 841. Springer, Singapore. https://doi.org/10.1007/978-981-13-2285-3_21
Download citation
DOI: https://doi.org/10.1007/978-981-13-2285-3_21
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2284-6
Online ISBN: 978-981-13-2285-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)