Performance Evaluation of Range Search Algorithm for k-dSLst Tree | Zendy

Sumeet Gill | Zendy; Meenakshi Meenakshi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Performance Evaluation of Range Search Algorithm for k-dSLst Tree

Author(s) -

Sumeet Gill,

Meenakshi Meenakshi

Publication year - 2019

Publication title -

international journal of recent technology and engineering (ijrte)

Language(s) - English

Resource type - Journals

ISSN - 2277-3878

DOI - 10.35940/ijrte.c5544.098319

Subject(s) - search engine indexing , computer science , range query (database) , r tree , range (aeronautics) , tree (set theory) , spatial analysis , data mining , graphics , algorithm , spatial database , quadtree , search algorithm , theoretical computer science , information retrieval , search engine , mathematics , computer graphics (images) , web search query , mathematical analysis , statistics , materials science , sargable , composite material

The indexing structures for spatial data are used to organize the data related to spatial objects with respect to their position. These indexing structures are indispensable in various applications like geographic information systems, robotics, computer graphics, CAD/CAM and many more. The range queries related to multiple dimensions are the crucial facet of many spatial applications. In this paper, we are introducing an algorithm kdSLst Objects In Range Search to search for spatial objects within a given range. We will be implementing this algorithm for k-dSLst tree, a spatial indexing tree based on k-d tree and linked list to store spatial data with duplicate keys, which we introduced in our earlier work. The experimental results show that the algorithm kdSLstObjectsInRangeSearch outperforms algorithm bruteForceRangeSearch based on brute force method of searching

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research