Continuous Obstructed Nearest Neighbor Queries in Spatial Databases

Summary: CONN: continuous obstructed nearest neighbor search on a query segment q; returns nearest data point under obstructed distance. Proposes exact CONN/COkNN with R-tree indices, a control-point and quad-split scheme; evaluated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4148
Venue: SIGMOD
Year: 2009
Pagerank: 4.8505287e-05
Overall Rank: 7,049 | 50.97%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Yunjun Gao
2. Baihua Zheng

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,925	Processing Moving kNN Queries Using Influential Neighbor Sets	2015	VLDB	4.427232e-05
9,307	Range-based Obstructed Nearest Neighbor Queries	2016	SIGMOD	4.3571035e-05
11,207	Closest Pairs Search Over Data Stream	2023	SIGMOD	4.1945683e-05

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
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083378538
47	Nearest Neighbor Queries	1995	SIGMOD	0.0007015885
983	An Efficient and Scalable Approach to CNN Queries in a Road Network	2005	VLDB	0.00014860126
1,275	Continuous Nearest Neighbor Search	2002	VLDB	0.00012883899
3,800	Time-Parameterized Queries in Spatio-Temporal Databases	2002	SIGMOD	6.7585633e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,165	Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search	2026	SIGMOD	4.1945683e-05
1,183	A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space	1997	PODS	0.00013455596
389	Query Processing in Spatial Network Databases	2003	VLDB	0.00024620268
47	Nearest Neighbor Queries	1995	SIGMOD	0.0007015885
2,360	Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring	2005	SIGMOD	8.9605432e-05
1,768	Closest Pair Queries in Spatial Databases	2000	SIGMOD	0.00010622873
598	Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases	2004	VLDB	0.00019474545
3,415	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB	7.1219721e-05
1,275	Continuous Nearest Neighbor Search	2002	VLDB	0.00012883899
9,307	Range-based Obstructed Nearest Neighbor Queries	2016	SIGMOD	4.3571035e-05