Materialization-Based Range and k-Nearest Neighbor Query Processing Algorithms

  • Jae-Woo Chang
  • Yong-Ki Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4027)


Recently, the spatial network databases (SNDB) have been studied for emerging applications such as location-based services including mobile search and car navigation. In practice, objects, like cars and people with mobile phones, can usually move on an underlying network (road, railway, sidewalk, river, etc.), where the network distance is determined by the length of the practical shortest path connecting two objects. In this paper, we propose materialization-based query processing algorithms for typical spatial queries in SNDB, such as range search and k nearest neighbors (k-NN) search. By using a materialization-based technique with the shortest network distances of all the nodes on the network, the proposed query processing algorithms can reduce the computation time of the network distance as well as the number of disk I/Os required for accessing nodes. Thus, the proposed query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1], respectively. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.


Query Processing Index Structure Range Search Query Point Spatial Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. of VLDB, pp. 802–813 (2003)Google Scholar
  2. 2.
    Shekhar, S., et al.: Spatial Databases – Accomplishments and Research Needs. IEEE Tran. on Knowledge and Data Engineering 11(1), 45–55 (1999)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Chang, J.-W., Um, J.-H., Lee, W.-C.: An Efficient Trajectory Index Structure for Moving Objects in Location-Based Services. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM-WS 2005. LNCS, vol. 3762, pp. 1107–1116. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Speicys, L., Jensen, C.S., Kligys, A.: Computational Data Modeling for Network-Constrained Moving Objects. In: Proc. of ACM GIS, pp. 118–125 (2003)Google Scholar
  5. 5.
    Jensen, C.S., Kolář, J., Pedersen, T.B., Timko, I.: Nearest Neighbor Queries in Road Networks. In: Proc. of ACM GIS, pp. 1–8 (2003)Google Scholar
  6. 6.
    Pfoser, D., Jensen, C.S.: Indexing of Network Constrained Moving Objects. In: Proc. of ACM GIS, pp. 25–32 (2003)Google Scholar
  7. 7.
    Seidl, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: A Dynamic Index for Multi-Dimensional Objects. In: Proc. of VLDB (1987)Google Scholar
  8. 8.
    Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Tran. on Knowledge and data Engineering 10(3), 409–432 (1998)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Seidl, T., Kriegel, H.: Optimal Multi-step k-Nearest Neighbor Search. In: Proc. of ACM SIGMOD (1998)Google Scholar
  11. 11.
  12. 12.
    Brinkhoff, T.: A Framework for Generating Network-Based Moving Objects. GeoInformatica 6(2), 153–180 (2002)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jae-Woo Chang
    • 1
  • Yong-Ki Kim
    • 1
  1. 1.Dept. of Computer EngineeringChonbuk National Univ.Chonju, ChonbukSouth Korea

Personalised recommendations