Processing Moving kNN Queries Using Influential Neighbor Sets

Summary: Replaces costly safe-region maintenance for moving kNN queries with a small set of safe-guarding (influential) objects. Proves the induced region is maximally safe, minimizing recomputation while avoiding order-k Voronoi construction; experiments show superiority. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11180
Venue: VLDB
Year: 2015
Pagerank: 5.3251649e-05
Overall Rank: 9,080 | 37.71%
DOI: 10.14778/2735471.2735473

Incoming Non-self Citations Over Time

Authors

1. Chuanwen Li (Northeastern University)
2. Yu Gu (Northeastern University)
3. Jianzhong Qi (University of Melbourne)
4. Ge Yu (Northeastern University)
5. Rui Zhang (University of Melbourne)
6. Wang Yi (Northeastern University)

BibTeX Citation

@article{li_vldb15,
        title = {{Processing Moving kNN Queries Using Influential Neighbor Sets}},
        author = {Li, Chuanwen and Gu, Yu and Qi, Jianzhong and Yu, Ge and Zhang, Rui and Yi, Wang},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {2},
        pages = {113--124},
        doi = {10.14778/2735471.2735473},
        url = {https://doi.org/10.14778/2735471.2735473},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,408	Closest Pairs Search Over Data Stream	2023	SIGMOD	5.093636e-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
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
28	Nearest Neighbor Queries	1995	SIGMOD	0.00052102434
665	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB	0.00015167291
1,281	Continuous Nearest Neighbor Search	2002	VLDB	0.00011349245
1,698	A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects	2005	SIGMOD	9.980335e-05
3,562	Location-based Spatial Queries	2003	SIGMOD	7.3080612e-05
3,581	Time-Parameterized Queries in Spatio-Temporal Databases	2002	SIGMOD	7.2873782e-05
4,937	The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries	2008	VLDB	6.4350791e-05
5,875	VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries	2010	VLDB	6.0564961e-05
7,140	Continuous Obstructed Nearest Neighbor Queries in Spatial Databases	2009	SIGMOD	5.6928705e-05
8,659	Spatial Queries with Two kNN Predicates	2012	VLDB	5.3904242e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,659	Spatial Queries with Two kNN Predicates	2012	VLDB
2	10,460	High-Throughput k Nearest Neighbors Search in Road Networks	2026	SIGMOD
3	1,441	Efficient Processing of Top-k Spatial Preference Queries	2011	VLDB
4	2,205	Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring	2005	SIGMOD
5	4,927	Neighbor-Sensitive Hashing	2016	VLDB
6	1,605	Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases	2008	VLDB
7	3,462	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB
8	665	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB
9	8,760	Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN	2009	VLDB
10	4,937	The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries	2008	VLDB