Cargando…

Query Optimization for Distributed Spatio-Temporal Sensing Data Processing

The unprecedented development of Internet of Things (IoT) technology produces humongous amounts of spatio-temporal sensing data with various geometry types. However, processing such datasets is often challenging due to high-dimensional sensor data geometry characteristics, complex anomalistic spatia...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Xin, Yu, Huayan, Yuan, Ligang, Qin, Xiaolin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8915072/
https://www.ncbi.nlm.nih.gov/pubmed/35270891
http://dx.doi.org/10.3390/s22051748
_version_ 1784667923021824000
author Li, Xin
Yu, Huayan
Yuan, Ligang
Qin, Xiaolin
author_facet Li, Xin
Yu, Huayan
Yuan, Ligang
Qin, Xiaolin
author_sort Li, Xin
collection PubMed
description The unprecedented development of Internet of Things (IoT) technology produces humongous amounts of spatio-temporal sensing data with various geometry types. However, processing such datasets is often challenging due to high-dimensional sensor data geometry characteristics, complex anomalistic spatial regions, unique query patterns, and so on. Timely and efficient spatio-temporal querying significantly improves the accuracy and intelligence of processing sensing data. Most existing query algorithms show their lack of supporting spatio-temporal queries and irregular spatial areas. In this paper, we propose two spatio-temporal query optimization algorithms based on SpatialHadoop to improve the efficiency of query spatio-temporal sensing data: (1) spatio-temporal polygon range query (STPRQ), which aims to find all records from a polygonal location in a time interval; (2) spatio-temporal k nearest neighbors query (STkNNQ), which directly searches the query point’s k closest neighbors. To optimize the STkNNQ algorithm, we further propose an adaptive iterative range optimization algorithm (AIRO), which can optimize the iterative range of the algorithm according to the query time range and avoid querying irrelevant data partitions. Finally, extensive experiments based on trajectory datasets demonstrate that our proposed query algorithms can significantly improve query performance over baseline algorithms and shorten response time by 81% and 35.6%, respectively.
format Online
Article
Text
id pubmed-8915072
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-89150722022-03-12 Query Optimization for Distributed Spatio-Temporal Sensing Data Processing Li, Xin Yu, Huayan Yuan, Ligang Qin, Xiaolin Sensors (Basel) Article The unprecedented development of Internet of Things (IoT) technology produces humongous amounts of spatio-temporal sensing data with various geometry types. However, processing such datasets is often challenging due to high-dimensional sensor data geometry characteristics, complex anomalistic spatial regions, unique query patterns, and so on. Timely and efficient spatio-temporal querying significantly improves the accuracy and intelligence of processing sensing data. Most existing query algorithms show their lack of supporting spatio-temporal queries and irregular spatial areas. In this paper, we propose two spatio-temporal query optimization algorithms based on SpatialHadoop to improve the efficiency of query spatio-temporal sensing data: (1) spatio-temporal polygon range query (STPRQ), which aims to find all records from a polygonal location in a time interval; (2) spatio-temporal k nearest neighbors query (STkNNQ), which directly searches the query point’s k closest neighbors. To optimize the STkNNQ algorithm, we further propose an adaptive iterative range optimization algorithm (AIRO), which can optimize the iterative range of the algorithm according to the query time range and avoid querying irrelevant data partitions. Finally, extensive experiments based on trajectory datasets demonstrate that our proposed query algorithms can significantly improve query performance over baseline algorithms and shorten response time by 81% and 35.6%, respectively. MDPI 2022-02-23 /pmc/articles/PMC8915072/ /pubmed/35270891 http://dx.doi.org/10.3390/s22051748 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Li, Xin
Yu, Huayan
Yuan, Ligang
Qin, Xiaolin
Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title_full Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title_fullStr Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title_full_unstemmed Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title_short Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
title_sort query optimization for distributed spatio-temporal sensing data processing
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8915072/
https://www.ncbi.nlm.nih.gov/pubmed/35270891
http://dx.doi.org/10.3390/s22051748
work_keys_str_mv AT lixin queryoptimizationfordistributedspatiotemporalsensingdataprocessing
AT yuhuayan queryoptimizationfordistributedspatiotemporalsensingdataprocessing
AT yuanligang queryoptimizationfordistributedspatiotemporalsensingdataprocessing
AT qinxiaolin queryoptimizationfordistributedspatiotemporalsensingdataprocessing