Article

Continuous nearest neighbor search

Authors:

Dimitris Papadias,

Qiongmao ShenAuthors Info & Claims

VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases

Pages 287 - 298

Published: 20 August 2002 Publication History

Abstract

A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from points to point e. The result contains a set of (point, interval) tuples, such that point is the NN of all points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitive application of simple NN algorithms, which incurs significant overhead. In this paper we propose techniques that solve the problem by performing a single query for the whole input segment. As a result the cost, depending on the query and dataset characteristics, may drop by orders of magnitude. In addition, we propose analytical models for the expected size of the output, as well as, the cost of query processing, and extend out techniques to several variations of the problem.

References

[1]

{BBKK97} Berchtold, S., Bohm, C., Keim, D. A., Kriegel, H. A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space. ACM PODS, 1997.

Digital Library

[2]

{BBK+01} Berchtold, S., Bohm, C., Keim, D., Krebs, F., Kriegel, H. P. On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. ICDT, 2001.

Digital Library

[3]

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

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. ACM SIGMOD, 1990.

Digital Library

[5]

{BS99} Bespamyatnikh, S., Snoeyink, J. Queries with Segments in Voronoi Diagrams. SODA, 1999.

Digital Library

[6]

{CMTV00} Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M. Closest Pair Queries in Spatial Databases. ACM SIGMOD, 2000.

Digital Library

[7]

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

Digital Library

[8]

{HS98} Hjaltason, G., Samet, H. Incremental Distance Join Algorithms for Spatial Databases. ACM SIGMOD 1998.

Digital Library

[9]

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

Digital Library

[10]

{KGT99a} Kollios, G., Gunopulos, D., Tsotras, V. On Indexing Mobile Objects. ACM PODS, 1999.

Digital Library

[11]

{KGT99b} Kollios, G., Gunopulos, D., Tsotras, V. Nearest Neighbor Queries in a Mobile Environment. Spatio-Temporal Database Management Workshop, 1999.

Digital Library

[12]

{KSF+96} Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E, Protopapas, Z. Fast Nearest Neighbor Search in Medical Image Databases. VLDB, 1996.

Digital Library

[13]

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

Digital Library

[14]

{SJLL00} Saltenis, S., Jensen, C., Leutenegger, S., Lopez, M. Indexing the Positions of Continuously Moving Objects. ACM SIGMOD, 2000.

Digital Library

[15]

{SK98} Seidl, T., Kriegel, H. Optimal Multi-Step K-Nearest Neighbor Search. ACM SIGMOD, 1998.

Digital Library

[16]

{SR01} Song, Z., Roussopoulos, N. K-Nearest Neighbor Search for Moving Query Point. SSTD, 2001.

Digital Library

[17]

{SRF87} Sellis, T., Roussopoulos, N. Faloutsos, C.: The R+-tree: a Dynamic Index for Multi-Dimensional Objects, VLDB, 1987.

Digital Library

[18]

{SWCD97} Sistla, P., Wolfson, O., Chamberlain, S., Dao, S. Modeling and Querying Moving Objects. IEEE ICDE, 1997.

Digital Library

[19]

{TP02} Tao, Y., Papadias, D. Time Parameterized Queries in Spatio-Temporal Databases. ACM SIGMOD, 2002.

Digital Library

[20]

{TSS00} Theodoridis, Y., Stefanakis, E., Sellis, T. Efficient Cost Models for Spatial Queries Using R-trees. IEEE TKDE, 12(1), pp. 19-32, 2000.

Digital Library

[21]

{web} http://dias.cti.gr/~ytheod/research/datasets/ spatial.html

[22]

{WSB98} Weber, R., Schek, H., Blott, S. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. VLDB, 1998.

Digital Library

[23]

{YOTJ01} Yu, C., Ooi, B. C., Tan, K. L., Jagadish, H. V. Indexing the Distance: An Efficient Method to KNN Processing. VLDB, 2001.

Digital Library

Cited By

Zheng BZheng KScheuermann PZhou XNguyen QLi C(2019)Searching activity trajectory with keywordsWorld Wide Web10.1007/s11280-018-0535-822:3(967-1000)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s11280-018-0535-8
(2018)QoS management in real-time spatial big data using a feedback control schedulingInternational Journal of Intelligent Information and Database Systems10.5555/3302748.330275211:4(266-295)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3302748.3302752
Mouratidis KTang B(2018)Exact processing of uncertain top-k queries in multi-criteria settingsProceedings of the VLDB Endowment10.14778/3204028.320403111:8(866-879)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.14778/3204028.3204031
Show More Cited By

Index Terms

Continuous nearest neighbor search
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

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 ...
Continuous nearest-neighbor search in the presence of obstacles

Despite the ubiquity of physical obstacles (e.g., buildings, hills, and blindages, etc.) in the real world, most of spatial queries ignore the obstacles. In this article, we study a novel form of continuous nearest-neighbor queries in the presence of ...
Confirmation Sampling for Exact Nearest Neighbor Search
Similarity Search and Applications
Abstract
Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases

August 2002

1110 pages

Publisher

VLDB Endowment

Publication History

Published: 20 August 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
803
Total Downloads

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

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zheng BZheng KScheuermann PZhou XNguyen QLi C(2019)Searching activity trajectory with keywordsWorld Wide Web10.1007/s11280-018-0535-822:3(967-1000)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s11280-018-0535-8
(2018)QoS management in real-time spatial big data using a feedback control schedulingInternational Journal of Intelligent Information and Database Systems10.5555/3302748.330275211:4(266-295)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3302748.3302752
Mouratidis KTang B(2018)Exact processing of uncertain top-k queries in multi-criteria settingsProceedings of the VLDB Endowment10.14778/3204028.320403111:8(866-879)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.14778/3204028.3204031
Qi JZhang RJensen CRamamohanarao KHE J(2018)Continuous Spatial Query ProcessingACM Computing Surveys10.1145/319383551:3(1-39)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3193835
Xu JGüting RGao Y(2018)Continuous k nearest neighbor queries over large multi-attribute trajectoriesGeoinformatica10.1007/s10707-018-0326-522:4(723-766)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10707-018-0326-5
Hidayat ACheema M(2017)QUIET ZONEProceedings of the 3rd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics10.1145/3152178.3152179(1-8)Online publication date: 7-Nov-2017
https://dl.acm.org/doi/10.1145/3152178.3152179
de Oliveira MNascimento M(2017)MinMax RoutingProceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/3139958.3140039(1-4)Online publication date: 7-Nov-2017
https://dl.acm.org/doi/10.1145/3139958.3140039
Chatzimilioudis GCosta CZeinalipour-Yazti DLee W(2017)Crowdsourcing emergency data in non-operational cellular networksInformation Systems10.1016/j.is.2015.11.00464:C(292-302)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.is.2015.11.004
Urra OIlarri STrillo-Lado R(2017)An approach driven by mobile agents for data management in vehicular networksInformation Sciences: an International Journal10.1016/j.ins.2016.11.007381:C(55-77)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.ins.2016.11.007
Shang SZhu SGuo DLu M(2017)Discovery of probabilistic nearest neighbors in traffic-aware spatial networksWorld Wide Web10.1007/s11280-016-0425-x20:5(1135-1151)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s11280-016-0425-x
Show More Cited By

View Options

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