DBScholar

Back to papers

Range-based Obstructed Nearest Neighbor Queries

Summary: RONN extends CONN to return obstructed NN for every point in a range; baseline CONNB reduces to R-tree range queries. Proposes O-tree with optimal obstacle balance (OOB) to partition obstructed space, enabling RONN-OA and polygon indexing; experiments show RONN-OA beats R-tree baselines and OOB offers best balance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5323
Venue
SIGMOD
Year
2016
Pagerank
5.282937e-05
Overall Rank
9,354 | 35.83%
DOI
10.1145/2882903.2915234

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhu_sigmod16,
        title = {{Range-based Obstructed Nearest Neighbor Queries}},
        author = {Zhu, Huaijie and Yang, Xiaochun and Wang, Bin and Lee, Wang-Chien},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2915234},
        url = {https://dl.acm.org/doi/10.1145/2882903.2915234},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers