Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

k-dStHash tree for indexing big spatio-temporal datasets

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 14 No. 3 (2024)

DOI
10.11591/ijece.v14i3.pp2937-2944
ISSN
2722-2578, 2088-8708
Published
2024-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Collaboration network of the authors

3 authors · 2 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Maharshi Dayanand University
  • Maharaja Surajmal Institute of Technology
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Menal DahiyaMaharaja Surajmal Institute of Technology1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>k-dStHash tree for indexing big spatio-temporal datasets</dc:title><dc:creator>Hooda, Meenakshi</dc:creator><dc:creator>Gill, Sumeet</dc:creator><dc:description>&lt;jats:p&gt;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.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2024-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v14i3.pp2937-2944</dc:identifier><dc:identifier>10.11591/ijece.v14i3.pp2937-2944</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 14 No 3 (2024); 2937</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/35386/17403</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>