The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries

Summary: V*-Diagram is a query-dependent safe-region method for MkNN queries that uses the query position and search-space context, not data objects alone. It reduces IO and computation dramatically, with experiments showing ~100× speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9930
Venue: VLDB
Year: 2008
Pagerank: 6.4350791e-05
Overall Rank: 4,937 | 66.13%
DOI: 10.14778/1453856.1453949

Incoming Non-self Citations Over Time

Authors

1. Sarana Nutanong (National ICT Australia; University of Melbourne)
2. Rui Zhang (University of Melbourne)
3. Egemen Tanin (National ICT Australia; University of Melbourne)
4. Lars Kulik (National ICT Australia; University of Melbourne)

BibTeX Citation

@article{nutanong_vldb08,
        title = {{The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries}},
        author = {Nutanong, Sarana and Zhang, Rui and Tanin, Egemen and Kulik, Lars},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {848--859},
        doi = {10.14778/1453856.1453949},
        url = {https://doi.org/10.14778/1453856.1453949},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,153	Monitoring Path Nearest Neighbor in Road Networks	2009	SIGMOD	9.0762376e-05
5,623	Efficient Proximity Detection among Mobile Users via Self-Tuning Policies	2010	VLDB	6.1453429e-05
6,830	Global Immutable Region Computation	2014	SIGMOD	5.759977e-05
7,806	Computing Immutable Regions for Subspace Top-k Queries	2013	VLDB	5.5407909e-05
9,080	Processing Moving kNN Queries Using Influential Neighbor Sets	2015	VLDB	5.3251649e-05
9,254	Boosting Moving Object Indexing through Velocity Partitioning	2012	VLDB	5.297624e-05
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
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0020210012
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
433	Scalable Network Distance Browsing in Spatial Databases	2008	SIGMOD	0.00018532516
449	Query Processing in Spatial Network Databases	2003	VLDB	0.0001826404
665	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB	0.00015167291
1,025	An Efficient and Scalable Approach to CNN Queries in a Road Network	2005	VLDB	0.00012578515
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

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,281	Continuous Nearest Neighbor Search	2002	VLDB
2	1,612	Reverse kNN Search in Arbitrary Dimensionality	2004	VLDB
3	5,875	VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries	2010	VLDB
4	2,886	Approximate NN Queries on Streams with Guaranteed Error/performance Bounds	2004	VLDB
5	8,659	Spatial Queries with Two kNN Predicates	2012	VLDB
6	3,363	Efficient k-NN Search on Vertically Decomposed Data	2002	SIGMOD
7	8,760	Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN	2009	VLDB
8	665	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB
9	3,462	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB
10	9,080	Processing Moving kNN Queries Using Influential Neighbor Sets	2015	VLDB