Answering range-based reverse kNN queries

  • Zhefan Zhong
  • , Xin Lin*
  • , Liang He
  • , Yan Yang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Despite significant progress on this problem, there is a research gap in finding RkNNs not just for an object, but for a given range, which is a natural extension of the problem. Motivated by this, we develop algorithms for exact processing of range-based RkNN with arbitrary values of k on dynamic datasets, which retrieve all the data points that have any position in the given query range R as one of their k nearest neighbors. The experimental results demonstrate the efficiency and the accuracy of our proposed optimizations and algorithms.

Original languageEnglish
Title of host publicationWeb and Big Data - Second International Joint Conference, APWeb-WAIM 2018, Proceedings
EditorsYi Cai, Yoshiharu Ishikawa, Jianliang Xu
PublisherSpringer Verlag
Pages368-376
Number of pages9
ISBN (Print)9783319968926
DOIs
StatePublished - 2018
Event2nd Asia Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2018 - Macau, China
Duration: 23 Jul 201825 Jul 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10988 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd Asia Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2018
Country/TerritoryChina
CityMacau
Period23/07/1825/07/18

Keywords

  • Location-based services
  • Range-based RkNN queries

Fingerprint

Dive into the research topics of 'Answering range-based reverse kNN queries'. Together they form a unique fingerprint.

Cite this