Next Article in Journal
Real-Time Arm Gesture Recognition Using 3D Skeleton Joint Data
Previous Article in Journal
An Introduction of NoSQL Databases Based on Their Categories and Application Industries
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

Pruning Optimization over Threshold-Based Historical Continuous Query

College of Electronic Engineering, Naval University of Engineering, Wuhan 430033, China
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(5), 107; https://doi.org/10.3390/a12050107
Received: 4 March 2019 / Revised: 5 May 2019 / Accepted: 18 May 2019 / Published: 19 May 2019
(This article belongs to the Special Issue Algorithms for Large Scale Data Analysis)
  |  
PDF [3541 KB, uploaded 28 May 2019]
  |  

Abstract

With the increase in mobile location service applications, spatiotemporal queries over the trajectory data of moving objects have become a research hotspot, and continuous query is one of the key types of various spatiotemporal queries. In this paper, we study the sub-domain of the continuous query of moving objects, namely the pruning optimization over historical continuous query based on threshold. Firstly, for the problem that the processing cost of the Mindist-based pruning strategy is too large, a pruning strategy based on extended Minimum Bounding Rectangle overlap is proposed to optimize the processing overhead. Secondly, a best-first traversal algorithm based on E3DR-tree is proposed to ensure that an accurate pruning candidate set can be obtained with accessing as few index nodes as possible. Finally, experiments on real data sets prove that our method significantly outperforms other similar methods. View Full-Text
Keywords: moving object; historical continuous query; pruning optimization; spatiotemporal index moving object; historical continuous query; pruning optimization; spatiotemporal index
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Qin, J.; Ma, L.; Liu, Q. Pruning Optimization over Threshold-Based Historical Continuous Query. Algorithms 2019, 12, 107.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top