Spatio-Temporal Range Search using K-DSTH Indexing Structure
Sumeet Gill1, Meenakshi2

1Sumeet Gill*, Department of Mathematics, M. D. University, Rohtak, Haryana, India.
2Meenakshi, Department of Mathematics, M. D. University, Rohtak, Haryana, India.
Manuscript received on September 21, 2019. | Revised Manuscript received on October 15, 2019. | Manuscript published on October 30, 2019. | PP: 3791-3797  | Volume-9 Issue-1, October 2019 | Retrieval Number: A9826109119/2019©BEIESP | DOI: 10.35940/ijeat.A9826.109119
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: A large amount of data which includes spatial and temporal information related to different fields like geography, satellite, medical or multimedia is generated and collected at an extraordinary scale. Such data is produced by satellites, mobile devices, emerging applications like social networking sites, photo sharing sites and many more. As the whole world is aware of the importance of such spatio-temporal data, a great amount of research work is evolving around efficient storage structures and algorithms to handle a variety of spatio-temporal queries. In this paper, the authors are introducing a novel spatio-temporal indexing structure k-dStH which is an extension of k-dSTHash indexing structure. It uses master hash table, local hash table and B-tree additionally which are based on timestamp values. The researchers also introduce an algorithm k-dStHSpa Temp Range Srch based on the proposed indexing structure to find spatio-temporal objects in given spatial range at particular temporal value. The performance analysis shows that the algorithm proposed by the authors is far more efficient as compared to brute force technique of searching for the spatio-temporal objects.
Keywords: Brute force, B-Tree, Hash Table, Indexing, k-d Tree, Spatio-temporal Dataset, Spatio-temporal Range Search.