• Apr 24, 2017 News! Vol.6, No.4 has been indexed by EI (Inspec).   [Click]
  • Apr 24, 2017 News! Vol.6, No.3 has been indexed by EI (Inspec).   [Click]
  • Mar 16, 2017 News!Vol 7, No 1 has been published with online version 11 original aritcles from 6 countries are published in this issue   [Click]
General Information
    • ISSN: 2010-3697
    • Frequency: Bimonthly
    • DOI: 10.7763/IJMO
    • Editor-in-Chief: Prof. Adrian Olaru
    • Executive Editor: Ms.Yoyo Y. Zhou
    • Abstracting/ Indexing: Engineering & Technology Digital Library, ProQuest, Crossref, Electronic Journals Library, DOAJ, Google Scholar, EI (INSPEC, IET).
    • E-mail ijmo@iacsitp.com
Editor-in-chief
Prof. Adrian Olaru
University Politehnica of Bucharest, Romania
I'm happy to take on the position of editor in chief of IJMO. It's a journal that shows promise of becoming a recognized journal in the area of modelling and optimization. I'll work together with the editors to help it progress.
IJMO 2015 Vol.5(4): 308-312 ISSN: 2010-3697
DOI: 10.7763/IJMO.2015.V5.480

An Edge-Based Algorithm for Spatial Query Processing in Real-Life Road Networks

Ye-In Chang, Meng-Hsuan Tsai, and Xu-Lun Wu
Abstract—Due to wireless communication technologies, positioning technologies, and mobile computing develop quickly, mobile services are becoming practical and important on big spatiotemporal databases management. Mobile service users move only inside a spatial network, e.g. a road network. They often issue the K Nearest Neighbor (KNN) query to obtain data objects reachable through the road network. The challenge problem of mobile services is how to efficiently answer the data objects which user interest to the corresponding mobile users. Lu et al. have proposed a RNG (Road Network Grid) index for speeding up the KNN query on real-life road networks. Since they divide the road, this makes the number of points of the graph increase. It increases the execution time of constructing the index structure. Therefore, in this paper, we propose a network model that captures the real-life road networks. We map the real-life road networks into graph directly. Then, based on our network model, we propose an EBNA (Edge-Based Nine-Area tree) index structure to make the search time of obtaining the interest edge information quickly. From our simulation result, we show that the performance of constructing the EBNA index is better than constructing the RNG index and the performance of the KNN query processing by using EBNA index is better than the KNN query processing by using RNG index.

Index Terms—Edge-based, index structure, KNN, road network.

Y. I. Chang and M. H. Tsai are with the Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, 80424 Taiwan (e-mail: changyi@cse.nsysu.edu.tw, d023040002@student.nsysu.edu.tw).

[PDF]

Cite: Ye-In Chang, Meng-Hsuan Tsai, and Xu-Lun Wu, "An Edge-Based Algorithm for Spatial Query Processing in Real-Life Road Networks," International Journal of Modeling and Optimization vol. 5, no. 4, pp. 308-312, 2015.

Copyright © 2008-2015.International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com