Distributed continuous KNN query over moving objects Online publication date: Tue, 30-Jul-2019
by Xiaolin Yang; Zhigang Zhang; Yilin Wang; Cheqing Jin
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 14, No. 2, 2019
Abstract: The Continuous K-Nearest Neighbour (CKNN) queries over moving objects have been widely researched in many fields. However, existing centralised works cannot work anymore and distributed solutions suffer the problem of index maintaining, high communication cost and query latency. In this paper, we firstly propose a distributed hybrid indexing strategy which combines the Spatial-temporal Sensitive Grid Index (SSGI) and the dynamic quad-tree index (DQI). The SSGI is proposed to locate the spatial range that contains the final results, and the DQI is used for data partitioning. Then, we introduce an algorithm named HDCKNN to implement the CKNN queries. In comparison of existing work, HDCKNN can achieve the final result in one round iteration, while existing methods require at least two rounds of iteration. Extensive experiments show that the performance of the proposed method is more efficient than state-of-the-art algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook