k-dStHash tree for indexing big spatio-temporal datasets

Meenakshi Hooda, Sumeet Gill


Today’s era is witness of tremendous ever growing spatial, temporal and spatiotemporal data. The huge spatio-temporal data immensely pushes the need for design and development of novel methods tailored for indexing spatio-temporal data. In this research paper, we propose the design of a novel spatio-temporal data indexing method, named as k-dStHash. We have proposed the algorithm k-dStHashInsertion for inserting spatio-temporal objects and an algorithm k-dStHashSrchPlaceTime has been used to search for the objects at given location and time. It is able to handle datasets with duplicate keys which has been ignored in many research works. Though the algorithm k-dStHashInsertion takes 1.3-1.5 times longer time to insert data in k-dStHash data structure as it needs to find a specific location to organize data efficiently, but when it comes to search for required records it is even more than 90 times faster when analyzed in comparison to brute force method. It is generalized enough to organize any kind of k-dimensional data and time-based data also including object finding, fleet management, clustering, leader identification, nearest neighbor, human/animal tracking, path finding and many more.


Brute force; Hash table; Indexing structure; Insertion algorithm; k-d tree; Linked list; Spatio-temporal data

Full Text:


DOI: http://doi.org/10.11591/ijece.v14i3.pp2937-2944

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578

This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).