Skip to main content
SpringerLink
Log in

Approximate range query processing in spatial network databases

  • Regular Paper
  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

Spatial range query is one of the most common queries in spatial databases, where a user invokes a query to find all the surrounding interest objects. Most studies in range search consider Euclidean distances to retrieve the result in low cost, but with poor accuracy (i.e., Euclidean distance less than or equal network distance). Thus, researchers show that range search in network distance retrieves the results with high accuracy but with a vast amount of network distance computations. However, both of these techniques retrieve all objects in a given radius with a high number of false hits. Yet, in many situations, retrieving all objects is not necessary, especially when there are already enough objects closer to the query point. Also, when the radius of the search increases, a demotion in the performance will occur. Hence, approximate results are valuable just as the exact result, and approximate results can be obtained much faster than the exact result and are less costly. In this paper, we propose two approximate range search methods in spatial road network, namely approximate range Euclidean restriction and approximate range network expansion, to reduce the number of false hits and the number of network distance computations in a considerable manner. After the verification, these two methods are shown to be robust and accurate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. AL-Khalidi, H., Taniar, D., Safar, M.: Approximate static and continuous range search in mobile navigation. In: Proceedings of 5th ICUIMC, ACM (2011)

  2. AL-Khalidi, H., Taniar, D., Safar, M.: Approximate static and continuous range query processing in spatial databases. Multimed Tools Appl (2012, accepted)

  3. Arya, S., Malamatos, T., Mount, D.: The effect of corners on the complexity of approximate range searching. Discret. Comput. Geom. 41(3), 398–443 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: SODA ’93: Proceedings of the fourth annual ACM–SIAM symposium on discrete algorithms, pp. 271–280. Society for Industrial and Applied Mathematics (1993)

  5. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891–923 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bern, M.: Approximate closest-point queries in high dimensions. Inf. Process. Lett. 45(2), 95–99 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bustos, B., Navarro, G.: Improving the space cost of k-nn search in metric spaces by using distance estimators. Multimed. Tools Appl. 41(2), 215–233 (2009)

    Article  Google Scholar 

  8. Chow, C.-Y., Mokbel, M.F., Naps, J., Nath, S.: Approximate evaluation of range nearest neighbor queries with quality guarantee. In SSTD ’09: Proceedings of the 11th international symposium on advances in spatial and temporal databases, pp. 283–301. Springer, Berlin (2009)

  9. Corral, A., Canadas, J., Vassilakopoulos, M.: Approximate algorithms for distance-based queries in high-dimensional data spaces using r-trees. In ADBIS ’02: Proceedings of the 6th east European conference on advances in databases and information systems, pp. 163–176. Springer, New York (2002)

  10. Corral, A., Vassilakopoulos, M.: On approximate algorithms for distance-based queries using r-trees. Comput. J. 48(2), 220-238 (2005)

    Article  Google Scholar 

  11. da Fonseca, G.D., Mount, D.M.: Approximate range searching: the absolute model. Comput. Geom. Theory Appl. 43(4), 434–444 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gao, Y., Zheng, B., Chen, G., Li, Q., Guo, X.: Continuous visible nearest neighbor query processing in spatial databases. VLDB J. 20(3), 371–396 (2011)

    Article  Google Scholar 

  13. Ghadiri, N., Baraani-Dastjerdi, A., Ghasem-Aghaee, N., Nematbakhsh, M.A.: Optimizing the performance and robustness of type-2 fuzzy group nearest-neighbor queries. Mobile Inf. Syst. 7(2), 123–145 (2011)

    Google Scholar 

  14. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In SIGMOD ’84: Proceedings of the 1984 ACM SIGMOD international conference on management of data, pp. 47–57. ACM (1984)

  15. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-trees: theory and applications. Springer, Berlin (2006)

    Book  MATH  Google Scholar 

  16. Morvan, F., Hameurlain, A. (2011) A mobile relational algebra. Mob. Inf. Syst. 7(1), 1–20

    Google Scholar 

  17. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In VLDB ’2003: Proceedings of the 29th international conference on very large data bases, pp. 802–813. VLDB Endowment (2003)

  18. Papadopoulos, S., Wang, L., Yang, Y., Papadias, D., Karras, P.: Authenticated multi-step nearest neighbor search. IEEE Trans. Knowl. Data Eng. PP(99), 1 (2010)

  19. Philippe Rigaux, A.V., Michel O., Scholl: Spatial Databases: With Application to GIS. Morgan Kaufmann, Burlington (2002)

    Google Scholar 

  20. Rodriguez, J.M., Zunino, A., Campo, M.: Introducing mobile devices into grid systems: a survey. Int. J. Web Grid Serv. 7(1), 1–40 (2011)

    Article  Google Scholar 

  21. Safar, M.: K nearest neighbor search in navigation systems. Mobile Inf. Syst. 1(3), 207–224 (2005)

    Google Scholar 

  22. Safar, M.: Spatial queries in road networks based on pine. J. Univ. Comput. Sci. 14(4), 590–611 (2008)

    Google Scholar 

  23. Shrivastava, B., Khataniar, G., Goswami, D.: Binary search tree: an efficient overlay structure to support range query. In: 27th international conference on distributed computing systems workshops, 2007. ICDCSW ’07. p. 77 (2007)

  24. Taniar, D., Leung, C.H.C., Rahayu, W., Goel, S.: High Performance Parallel Database Processing and Grid Databases. Wiley, New York (2008)

    Book  Google Scholar 

  25. Taniar, D., Safar, M., Tran, Q.T., Rahayu, W., Park, J.H.: Spatial network rnn queries in gis. Comput. J. 54(4):617–627 (2011)

    Article  Google Scholar 

  26. Tran, Q., Taniar, D., Safar, M.: Reverse k nearest neighbor and reverse farthest neighbor search on spatial networks. In: Transactions on large-scale data- and knowledge-centered systems I. Volume 5740 of Lecture Notes in Computer Science, pp. 353–372. Springer, Berlin (2009)

  27. Xuan, K., Zhao, G., Taniar, D., Rahayu, W., Safar, M., Srinivasan, B.: Voronoi-based range and continuous range query processing in mobile databases. J. Comput. Syst. Sci. 77(4), 637–651 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  28. Xuan, K., Zhao, G., Taniar, D., Safar, M., Srinivasan, B.: Constrained range search query processing on road networks. Concurr. Comput. Pract. Exp. 5(23), 491–504 (2011)

    Article  Google Scholar 

  29. Xuan, K., Zhao, G., Taniar, D., Safar, M., Srinivasan, B.: Voronoi-based multi-level range search in mobile navigation. Multimed. Tools Appl. 53(2), 459–479 (2011)

    Article  Google Scholar 

  30. Yildizli, C., Pedersen, T.B., Saygin, Y., Savas, E., Levi, A.: Distributed privacy preserving clustering via homomorphic secret sharing and its application to (vertically) partitioned spatio-temporal data. Int. J. Data Warehous Min 7(1), 46–66 (2011)

    Article  Google Scholar 

  31. Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Volume 32 of Advances in Database Systems. Springer, New York (2006)

    Google Scholar 

  32. Zhao, G., Xuan, K., Rahayu, W., Taniar, D., Safar, M., Gavrilova M., Srinivasan, B.: Voronoi-based continuous k nearest neighbor search in mobile navigation. IEEE Trans. Ind. Electron. 58(6), 2247–2257 (2011)

    Article  Google Scholar 

  33. Zhao, G., Xuan, K., Taniar, D., Srinivasan, B.: Incremental k-nearest-neighbor search on road networks. J. Interconnect. Netw. 9(4), 455–470 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Clayton School of Information Technology, Monash University, Melbourne, Australia

    Haidar AL-Khalidi & Zainab Abbas

  2. Computer Engineering, Kuwait University, Kuwait, Kuwait

    Maytham Safar

Authors
  1. Haidar AL-Khalidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zainab Abbas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maytham Safar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haidar AL-Khalidi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

AL-Khalidi, H., Abbas, Z. & Safar, M. Approximate range query processing in spatial network databases. Multimedia Systems 19, 151–161 (2013). https://doi.org/10.1007/s00530-012-0286-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00530-012-0286-9

Keywords

Search

Navigation