Processing Moving kNN Queries Using Influential Neighbor Sets

Summary: Proposes Influential Neighbor Sets as safe guarding objects to maintain moving kNNs without costly safe region updates. Proves that when current kNNs are closer than safeguarding objects, they stay valid, and that this region is maximal, reducing recomputations; validated by extensive experiments against state-of-the-art on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10992
Venue: VLDB
Year: 2015
Pagerank: 4.427232e-05
Overall Rank: 8,925 | 37.92%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,207	Closest Pairs Search Over Data Stream	2023	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
47	Nearest Neighbor Queries	1995	SIGMOD	0.0007015885
598	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB	0.00019474545
1,275	Continuous Nearest Neighbor Search	2002	VLDB	0.00012883899
1,917	A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects	2005	SIGMOD	0.0001009778
3,800	Time-Parameterized Queries in Spatio-Temporal Databases	2002	SIGMOD	6.7585633e-05
3,814	Location-based Spatial Queries	2003	SIGMOD	6.7341058e-05
4,882	The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries	2008	VLDB	5.8548674e-05
5,917	VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries	2010	VLDB	5.2739511e-05
7,049	Continuous Obstructed Nearest Neighbor Queries in Spatial Databases	2009	SIGMOD	4.8505287e-05
8,629	Spatial Queries with Two kNN Predicates	2012	VLDB	4.4809879e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,629	Spatial Queries with Two kNN Predicates	2012	VLDB	4.4809879e-05
10,171	High-Throughput k Nearest Neighbors Search in Road Networks	2026	SIGMOD	4.1945683e-05
1,403	Efficient Processing of Top-k Spatial Preference Queries	2011	VLDB	0.00012176993
2,360	Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring	2005	SIGMOD	8.9605432e-05
5,224	Neighbor-Sensitive Hashing	2016	VLDB	5.6197981e-05
1,542	Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases	2008	VLDB	0.00011456321
3,415	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB	7.1219721e-05
598	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB	0.00019474545
8,557	Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN	2009	VLDB	4.4937074e-05
4,882	The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries	2008	VLDB	5.8548674e-05