New Query Processing Algorithms for Range and k-NN Search in Spatial Network Databases

  • Jae-Woo Chang
  • Yong-Ki Kim
  • Sang-Mi Kim
  • Young-Chang Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4231)


In this paper, we design the architecture of disk-based data structures for spatial network databases (SNDB). Based on this architecture, we propose new query processing algorithms for range search and k nearest neighbors (k-NN) search, depending on the density of point of interests (POIs) in the spatial network. For this, we effectively combine Euclidean restriction and the network expansion techniques according to the density of POIs. In addition, our two query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using maintaining the shortest network distances of all the nodes in the spatial network. It is shown that our range query processing algorithm achieves about up to one order of magnitude better performance than the existing range query processing algorithm, such as RER and RNE [1]. In addition, our k-NN query processing algorithm achieves about up to 170~400% performance improvements over the existing network expansion k-NN algorithm, called INE, while it shows about up to one order of magnitude better performance than the existing Euclidean restriction k-NN algorithm, called IER [1].


Query Processing Range Query Query Point Spatial Network Network Distance 
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.
    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
  4. 4.
    Pfoser, D., Jensen, C.S.: Indexing of Network Constrained Moving Objects. In: Proc. of ACM GIS, pp. 25–32 (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.
    Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Querying in Spatial Networks. In: Proc. of VLDB, pp. 840–851 (2004)Google Scholar
  7. 7.
    Huang, X., Jensen, C.S., Saltenis, S.: The islands Approach to Nearest Neighbors Search for Spatial Network Databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 73–90. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Seidl, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a Dynamic Index for Multi-Dimensional Objects. In: Proc. of VLDB (1987)Google Scholar
  9. 9.
    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
  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)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

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

Personalised recommendations