A spatial access method approach to continuous k-nearest neighbour processing for location-based services
by Wendy Osborn
International Journal of Grid and Utility Computing (IJGUC), Vol. 11, No. 2, 2020

Abstract: In this paper, two strategies for handling continuous k-nearest neighbour queries for location-based services are proposed. CKNN1 and CKNN2 utilise a validity (i.e., safe) region approach for minimising the number of query requests that need to be send to the server. They also use a two-dimensional spatial access method for both validity region selection and in-structure searching. The latter feature ensures that new searches for a validity region are not required to begin from the root. An evaluation and comparison of both strategies is performed against repeated nearest neighbour search. Both random and exponentially distributed point sets are utilised. Results show that both approaches achieve significant performance gains, especially with respect to reducing the number of queries that must be sent from the client to the server.

Online publication date: Tue, 03-Mar-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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