Author:
Gu Yu,Zhang Hui,Wang Zhigang,Yu Ge
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference27 articles.
1. Ali, M.E., Tanin, E., Zhang, R., Kotagiri, R.: Probabilistic voronoi diagrams for probabilistic moving nearest neighbor queries. Data Knowl. Eng. 75, 1–33 (2012)
2. Aly, A.M., Aref, W.G., Ouzzani, M.: Spatial queries with two knn predicates. Proc. VLDB Endowment 5(11), 1100C1111 (2012)
3. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record 19(2), 322–331 (1990)
4. Bespamyatnikha, S., Snoeyinka, J.: Queries with segments in Voronoi diagrams. Comput. Geom. 16(1), 23–33 (2000)
5. Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: Proceedings of SIGMOD, pp. 577–590 (2009)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献