Database Paper Browser

Back to papers

Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates

Summary: Maintains continuous k-NN for moving points under updates by reprocessing pending events to preserve results. Introduces a continuous within filter to prune candidates, reducing maintenance cost with modest event growth; experiments compare with recent work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9001
Venue
VLDB
Year
2003
Pagerank
7.1219721e-05
Overall Rank
3,415 | 76.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
47 Nearest Neighbor Queries 1995 SIGMOD 0.0007015885
95 Maintaining Views Incrementally 1993 SIGMOD 0.00050896659
242 Generalized Search Trees for Database Systems (Extended Abstract) 1995 VLDB 0.00031110894
631 Indexing the Positions of Continuously Moving Objects 2000 SIGMOD 0.00018935493
1,766 Indexing Moving Points (Extended Abstract) 2000 PODS 0.000106236
3,800 Time-Parameterized Queries in Spatio-Temporal Databases 2002 SIGMOD 6.7585633e-05
7,594 On Moving Object Queries (Extended Abstract) 2002 PODS 4.7019462e-05
Previous Page 1 / 1 Next

Semantically Similar Papers