Article

Reverse kNN search in arbitrary dimensionality

Authors:

Dimitris Papadias,

Xiang LianAuthors Info & Claims

VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Pages 744 - 755

Published: 31 August 2004 Publication History

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. Existing methods for processing such queries have at least one of the following deficiencies: (i) they do not support arbitrary values of k (ii) they cannot deal efficiently with database updates, (iii) they are applicable only to 2D data (but not to higher dimensionality), and (iv) they retrieve only approximate results. Motivated by these shortcomings, we develop algorithms for exact processing of RkNN with arbitrary values of k on dynamic multidimensional datasets. Our methods utilize a conventional data-partitioning index on the dataset and do not require any pre-computation. In addition to their flexibility, we experimentally verify that the proposed algorithms outperform the existing ones even in their restricted focus.

References

[1]

{BJKS02} Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. IDEAS, 2002.

Digital Library

[2]

{BKK96} Berchtold, S., Keim, D., Kriegel, H. The X-tree: An Index Structure for High-Dimensional Data. VLDB, 1996.

Digital Library

[3]

{BKOS97} Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O. Computational Geometry: Algorithms and Applications. ISBN 3-540-65620-0. Springer, 1997.

Digital Library

[4]

{BKSS90} Beckmann, N., Kriegel, H. P., Schneider, R., Seeger, B. The R^*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD, 1990.

Digital Library

[5]

{CF98} Cheung, K., Fu, A. Enhanced Nearest Neighbour Search on the R-tree. SIGMOD Record 27(3): 16-21, 1998.

Digital Library

[6]

{FSAA01} Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A. Constrained Nearest Neighbor Queries. SSTD, 2001.

Digital Library

[7]

{G84} Guttman, A. R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD, 1984.

Digital Library

[8]

{GRSY97} Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J. Processing Queries By Linear Constraints. PODS, 1997.

Digital Library

[9]

{H94} Henrich, A. A Distance Scan Algorithm for Spatial Access Structures. ACM GIS, 1994.

[10]

{HS99} Hjaltason, G., Samet, H. Distance Browsing in Spatial Databases. TODS, 24(2), 265-318, 1999.

Digital Library

[11]

{KM00} Korn, F., Muthukrishnan, S. Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD, 2000.

Digital Library

[12]

{KMS02} Korn, F., Muthukrishnan, S. Srivastava, D. Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB, 2002.

Digital Library

[13]

{LNY03} Lin, K., Nolen, M., Yang, C. Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems. IDEAS, 2003.

[14]

{MVZ02} Maheshwari, A., Vahrenhold, J., Zeh, N. On Reverse Nearest Neighbor Queries. CCCG, 2002.

[15]

{RKV95} Roussopoulos, N., Kelly, S., Vincent, F. Nearest Neighbor Queries. SIGMOD, 1995.

Digital Library

[16]

{SAA00} Stanoi, I., Agrawal, D., Abbadi, A., Reverse Nearest Neighbor Queries for Dynamic Databases. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000.

[17]

{SFT03} Singh, A., Ferhatosmanoglu, H., Tosun, A. High Dimensional Reverse Nearest Neighbor Queries. CIKM, 2003.

Digital Library

[18]

{SRAA01} Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A. Discovery of Influence Sets in Frequently Updated Databases. VLDB, 2001.

Digital Library

[19]

{TS96} Theodoridis, Y., Sellis, T. A Model for the Prediction of R-tree Performance. PODS, 1996.

Digital Library

[20]

{YL01} Yang, C., Lin, K. An Index Structure for Efficient Reverse Nearest Neighbor Queries. ICDE, 2001.

Digital Library

Cited By

Zhang JHarn PKu WSun MQin XLu HJiang X(2019)An overlapping Voronoi diagram-based system for multi-criteria optimal location queriesGeoinformatica10.1007/s10707-018-00338-723:1(105-161)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s10707-018-00338-7
Dong YChen HYu JFuruse KKitagawa H(2018)Weighted Aggregate Reverse Rank QueriesACM Transactions on Spatial Algorithms and Systems10.1145/32252164:2(1-23)Online publication date: 10-Aug-2018
https://dl.acm.org/doi/10.1145/3225216
Tzouramanis TManolopoulos YDesai BFlesca SZumpano EMasciari ECaroprese L(2018)Secure Reverse k-Nearest Neighbours Search over Encrypted Multi-dimensional DatabasesProceedings of the 22nd International Database Engineering & Applications Symposium10.1145/3216122.3216170(84-94)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3216122.3216170
Show More Cited By

Index Terms

Reverse kNN search in arbitrary dimensionality
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
  2. Information retrieval
    1. Evaluation of retrieval results
    2. Information retrieval query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Efficient reverse k-nearest neighbor search in arbitrary metric spaces
SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data

The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the reverse 1-nearest neighbor problem which has received increasing ...
Multidimensional reverse kNN search

Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least one of the following deficiencies: they ...
Ranked Reverse Nearest Neighbor Search

Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

August 2004

1380 pages

ISBN:0120884690

Sponsors

VLDB Endowment: Very Large Database Endowment

Publisher

VLDB Endowment

Publication History

Published: 31 August 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

72
Total Citations
View Citations
581
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang JHarn PKu WSun MQin XLu HJiang X(2019)An overlapping Voronoi diagram-based system for multi-criteria optimal location queriesGeoinformatica10.1007/s10707-018-00338-723:1(105-161)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s10707-018-00338-7
Dong YChen HYu JFuruse KKitagawa H(2018)Weighted Aggregate Reverse Rank QueriesACM Transactions on Spatial Algorithms and Systems10.1145/32252164:2(1-23)Online publication date: 10-Aug-2018
https://dl.acm.org/doi/10.1145/3225216
Tzouramanis TManolopoulos YDesai BFlesca SZumpano EMasciari ECaroprese L(2018)Secure Reverse k-Nearest Neighbours Search over Encrypted Multi-dimensional DatabasesProceedings of the 22nd International Database Engineering & Applications Symposium10.1145/3216122.3216170(84-94)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3216122.3216170
Casanova GEnglmeier EHoule MKröger PNett MSchubert EZimek A(2017)Dimensional testing for reverse k-nearest neighbor searchProceedings of the VLDB Endowment10.14778/3067421.306742610:7(769-780)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.14778/3067421.3067426
Biega AGhazimatin AFerhatosmanoglu HGummadi KWeikum GLim EWinslett MSanderson MFu ASun JCulpepper SLo EHo JDonato DAgrawal RZheng YCastillo CSun ATseng VLi C(2017)Learning to Un-RankProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3133040(267-276)Online publication date: 6-Nov-2017
https://dl.acm.org/doi/10.1145/3132847.3133040
Zhao PFang HSheng VLi ZXu JWu JCui Z(2017)Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors searchWorld Wide Web10.1007/s11280-016-0399-820:1(39-59)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s11280-016-0399-8
Chung YSu ILee CLiu P(2017)Multiple k nearest neighbor searchWorld Wide Web10.1007/s11280-016-0392-220:2(371-398)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s11280-016-0392-2
Yang SCheema MLin XZhang YZhang W(2017)Reverse k nearest neighbors queries and spatial reverse top-k queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0445-226:2(151-176)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00778-016-0445-2
Li MChen LCong GGu YYu GMukhopadhyay SZhai CBertino ECrestani FMostafa JTang JSi LZhou XChang YLi YSondhi P(2016)Efficient Processing of Location-Aware Group Preference QueriesProceedings of the 25th ACM International on Conference on Information and Knowledge Management10.1145/2983323.2983757(559-568)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2983323.2983757
Lin HChen FGao YLu D(2016)Finding optimal region for bichromatic reverse nearest neighbor in two- and three-dimensional spacesGeoinformatica10.1007/s10707-015-0239-520:3(351-384)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1007/s10707-015-0239-5
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents