Continuous range search based on network Voronoi diagram

International Journal of Grid and Utility Computing

Volumn 1, Issue 4, 2009, Pages 328-335

  Xuan, Kefeng ^a   Zhao, Geng ^a   Taniar, David ^a   Srinivasan, Bala ^a   Safar, Maytham ^b   Gavrilova, Marina ^c  

^a MONASH UNIVERSITY   (Australia)

^b KUWAIT UNIVERSITY   (Kuwait)

^c UNIVERSITY OF CALGARY   (Canada)

Author keywords

Geographic information system; GIS; Global position system; GPS; Mobile navigation; Network Voronoi diagram; NVD; Range search; Road network

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOGRAPHIC INFORMATION SYSTEMS; GLOBAL POSITIONING SYSTEM; GRAPHIC METHODS; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; QUERY PROCESSING;

ACCEPTABLE PERFORMANCE; EUCLIDEAN DISTANCE; GLOBAL POSITION SYSTEMS; K-NEAREST NEIGHBOURS; NETWORK DISTANCE; NETWORK VORONOI DIAGRAMS; RANGE SEARCH; ROAD NETWORK;

SEARCH ENGINES;

EID: 69249212467     PISSN: 1741847X     EISSN: 17418488     Source Type: Journal    
DOI: 10.1504/IJGUC.2009.027922     Document Type: Article

References (23)

1. Dijkstra, E.W. (1959) 'A note on two problems in connection with graphs', Numerische Mathematik, Vol. 1, No. 22, pp.269-271.
2. Gavrilova, M.L. and Rokne, J.G. (1999) 'Swap conditions for dynamic Voronoi diagrams for circles and line segments', Computer Aided Geometric Design, Vol. 16, No. 2, pp.89-106.
3. Gavrilova, M.L. and Rokne, J.G. (2003) 'Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space', Computer Aided Geometric Design, Vol. 20, No. 4, pp.231-242.
4. Goh, J.Y. and Taniar, D. (2004a) 'Mobile data mining by location dependencies', Proceedings of the 5th International Conference Intelligent Data Engineering and Automated Learning (IDEAL 2004), Lecture Notes in Computer Science, Vol. 3177, Springer, pp.225-231.
5. Goh, J.Y. and Taniar, D. (2004b) 'Mining frequency pattern from mobile users', Proceedings of the 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), Part III, Lecture Notes in Computer Science, Vol. 3215, Springer, pp.795-801.
6. Gulliver, S.R., Ghinea, G., Patel, M. and Serif, T. (2007) 'A context-aware tour guide: User implications', Mobile Information Systems, Vol. 3, No. 2, pp.71-88.
7. Guttman, A. (1984) 'R-trees: A dynamic index structure for spatial searching', Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD 1984), ACM Press, pp.47-57.
8. Kolahdouzan, M.R. and Shahabi, C. (2004) 'Voronoi-based k nearest neighbor search for spatial network databases', Proceedings of the 13th International Conference on Very Large Data Bases (VLDB 2004), Morgan Kaufmann, pp.840-851.
9. Kolahdouzan, M.R. and Shahabi, C. (2005) 'Alternative solutions for continuous k nearest neighbour queries in spatial network databases', Geoinformatica, Vol. 9, No. 4, pp.321-341.
10. Lee, D.L., Zhu, M. and Hu, H. (2005) 'When location-based services meet databases', Mobile Information Systems, Vol. 1, No. 2, pp.81-90.
11. Okabe, A., Boots, B., Sugihara, K. and Chiu, S.N. (2000) Spatial Tessellations, Concepts and Applications of Voronoi Diagrams, 2nd ed., John Wiley & Sons Ltd.
12. Papadias, D., Zhang, J., Mamoulis, N. and Tao, Y. (2003) 'Query processing in spatial network databases', Proceedings of 29th International Conference on Very Large Data Bases (VLDB 2003), Morgan Kaufmann, pp.802-813.
13. Roussopoulos, N., Kelley, S. and Vincent, F. (1995) 'Nearest neighbor queries', Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD 1995), ACM Press, pp.71-79.
14. Safar, M. (2005) 'K nearest neighbor search in navigation systems', Mobile Information Systems, Vol. 1, No. 3, pp.207-224.
15. Safar, M. and Ebrahimi, D. (2006) 'eDAR algorithm for continuous kNN queries based on PINE', International Journal of Information Technology and Web Engineering, IGI Global, Vol. 1, No. 4, pp.1-21.
16. Seidl, T. and Kriegel, H-P. (1998) 'Optimal multi-step k-nearest neighbor search', Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD 1998), ACM Press, pp.154-165.
17. Tao, Y., Papadias, D. and Shen, Q. (2002) 'Continuous nearest neighbor search', Proceedings of 28th International Conference on Very Large Data Bases (VLDB 2002), Morgan Kaufmann, pp.287-298.
18. Telstra Corporation (2008) Whereis, Melbourne. Available online at: http://www.whereis.com (accessed on 10 June 2008).
19. Waluyo, A.B., Srinivasan, B. and Taniar, D. (2003) 'Optimal broadcast channel for data dissemination in mobile database environment', Proceedings of the 5th International Workshop on Advanced Parallel Programming Technologies (APPT 2003), Lecture Notes in Computer Science, Vol. 2834, Springer, pp.655-664.
20. Waluyo, A.B., Srinivasan, B. and Taniar, D. (2004) 'A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile database', Proceedings of the 18th International Conference on Advanced Information Networking and Applications (AINA 2004), IEEE Computer Society, Fukuoka, Japan, pp.213-218.
21. Waluyo, A.B., Srinivasan, B. and Taniar, D. (2005) 'Research in mobile database query optimization and processing', Mobile Information Systems, Vol. 1, No. 4, pp.225-252.
22. Xuan, K., Zhao, G., Taniar, D. and Srinivasan, B. (2008) 'Continuous range search query processing in mobile navigation', Proceedings of the International Conference on Parallel and Distributed Systems (ICPADS 2008), IEEE Computer Society, Melbourne, pp.361-368.
23. Zhao, G., Xuan, K., Taniar, D. and Srinivasan, B. (2008) 'Incremental k-nearest neighbour search on road networks', Journal of Interconnection Networks (JOIN), Vol. 9, No. 4, pp.455-470.