Continuous monitoring of Reverse Approximate Nearest Neighbour queries on road network

Xinyu Li; Arif Hidayat; David Taniar; Muhammad Aamir Cheema

doi:10.1016/j.ins.2024.120464

Continuous monitoring of Reverse Approximate Nearest Neighbour queries on road network

Xinyu Li, Arif Hidayat, David Taniar, Muhammad Aamir Cheema

Research output: Contribution to journal › Article › Research › peer-review

Abstract

Reverse Approximate Nearest Neighbour (RANN) query relaxes the RkNN definition of influence, where a user u can be influenced by not only its closest facility but also by every other facility that is almost as close to u as its closest facility is. In this paper, we study the continuous monitoring of RANN queries on road network. Existing continuous RANN algorithms on Euclidean space cannot be extended to continuously monitor RANN queries on road network. We propose two different methods to efficiently monitor RANN queries.

Original language	English
Article number	120464
Number of pages	15
Journal	Information Sciences
Volume	667
DOIs	https://doi.org/10.1016/j.ins.2024.120464
Publication status	Published - May 2024

Keywords

NVD
RANN
RkNN

Access to Document

10.1016/j.ins.2024.120464Licence: CC BY

588068847-oaFinal published version, 1.74 MBLicence: CC BY

Cite this

@article{b7b53cc0b5a8410ba1c52e0cce525135,

title = "Continuous monitoring of Reverse Approximate Nearest Neighbour queries on road network",

abstract = "Reverse Approximate Nearest Neighbour (RANN) query relaxes the RkNN definition of influence, where a user u can be influenced by not only its closest facility but also by every other facility that is almost as close to u as its closest facility is. In this paper, we study the continuous monitoring of RANN queries on road network. Existing continuous RANN algorithms on Euclidean space cannot be extended to continuously monitor RANN queries on road network. We propose two different methods to efficiently monitor RANN queries.",

keywords = "NVD, RANN, RkNN",

author = "Xinyu Li and Arif Hidayat and David Taniar and Cheema, {Muhammad Aamir}",

note = "Publisher Copyright: {\textcopyright} 2024 The Authors",

year = "2024",

month = may,

doi = "10.1016/j.ins.2024.120464",

language = "English",

volume = "667",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier",

}

TY - JOUR

T1 - Continuous monitoring of Reverse Approximate Nearest Neighbour queries on road network

AU - Li, Xinyu

AU - Hidayat, Arif

AU - Taniar, David

AU - Cheema, Muhammad Aamir

PY - 2024/5

Y1 - 2024/5

N2 - Reverse Approximate Nearest Neighbour (RANN) query relaxes the RkNN definition of influence, where a user u can be influenced by not only its closest facility but also by every other facility that is almost as close to u as its closest facility is. In this paper, we study the continuous monitoring of RANN queries on road network. Existing continuous RANN algorithms on Euclidean space cannot be extended to continuously monitor RANN queries on road network. We propose two different methods to efficiently monitor RANN queries.

AB - Reverse Approximate Nearest Neighbour (RANN) query relaxes the RkNN definition of influence, where a user u can be influenced by not only its closest facility but also by every other facility that is almost as close to u as its closest facility is. In this paper, we study the continuous monitoring of RANN queries on road network. Existing continuous RANN algorithms on Euclidean space cannot be extended to continuously monitor RANN queries on road network. We propose two different methods to efficiently monitor RANN queries.

KW - NVD

KW - RANN

KW - RkNN

UR - http://www.scopus.com/inward/record.url?scp=85188736125&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2024.120464

DO - 10.1016/j.ins.2024.120464

M3 - Article

AN - SCOPUS:85188736125

SN - 0020-0255

VL - 667

JO - Information Sciences

JF - Information Sciences

M1 - 120464

ER -

Continuous monitoring of Reverse Approximate Nearest Neighbour queries on road network

Abstract

Keywords

Access to Document

Other files and links

Cite this