Yufei Tao, Dimitris Papadias, Qiongmao Shen  Home/Search
Context Related
| cs.ust.hk/vldb2002/VLDB200...S09P02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ust.hk/vldb2002/VLDB2002pa... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 point s 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... (Update)
Similar documents based on text: More All
0.6: Time-Parameterized Queries in Spatio-Temporal Databases - Tao, Papadias (2002) (Correct)
0.5: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and.. - Yufei, Papadias (2000) (Correct)
0.5: Aggregate Processing of Planar Points - Tao, Papadias, Zhang (2002) (Correct)
BibTeX entry: (Update)
Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. VLDB, 2002. http://citeseer.ist.psu.edu/tao02continuous.html More
@misc{ tao02continuous,
author = "Y. Tao and D. Papadias and Q. Shen",
title = "Continuous nearest neighbor search",
text = "Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. VLDB,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/tao02continuous.html" }
Citations (may not include all citations):765 trees: A Dynamic Index Structure for Spatial Searching (context) - Guttman - 1984
516 tree: An Efficient and Robust Access Method for Points and R.. (context) - Beckmann, Kriegel et al. - 1990
233 tree: a Dynamic Index for MultiDimensional Objects - Sellis, Roussopoulos et al. - 1987
193 Nearest Neighbor Queries - Roussopoulos, Kelly et al. - 1995
121 A Cost Model for Nearest Neighbor Search in High-Dimensional.. (context) - Berchtold, Bohm et al. - 1997
110 Modeling and Querying Moving Objects - Sistla, Wolfson et al. - 1997
106 Indexing the Positions of Continuously Moving Objects - Saltenis, Jensen et al. - 2000
83 Fast Nearest Neighbor Search in Medical Image Databases - Korn, Sidiropoulos et al. - 1996
80 On Indexing Mobile Objects - Kollios, Gunopulos et al. - 1999
68 Optimal Multi-Step KNearest Neighbor Search - Seidl, Kriegel - 1998
48 Distance Browsing in Spatial Databases - Hjaltason, Samet - 1999
41 Incremental Distance Join Algorithms for Spatial Databases - Hjaltason, Samet - 1998
23 Nearest Neighbor Search for Moving Query Point (context) - Song, Roussopoulos - 2001
21 Closest Pair Queries in Spatial Databases - Corral, Manolopoulos et al. - 2000
20 Nearest Neighbor Queries in a Mobile Environment - Kollios, Gunopulos et al. - 1999
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ust.hk/vldb2002/VLDB2002-papers/): More
LegoDB: Customizing Relational Storage for XML Documents - Bohannon, Freire.. (2002) (Correct)
Adaptive Index Structures - Tao, Papadias (2002) (Correct)
enTrans: A System for Flexible Consistency.. - Herlekar.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC