Skip to main content
SpringerLink
Log in

Approximate algorithms for static and continuous range queries in mobile navigation

  • Published:
Computing Aims and scope Submit manuscript

Abstract

For many years, spatial range search has been applied to computational geometry and multimedia problems to find interest objects within a given radius. Range search query has traditionally been used to return all objects within a given radius. However, having all objects is not necessary, especially when there are already enough objects closer to the query point. Furthermore, expanding the radius may give users better results, especially when there are a lot of objects just outside the search boundary. Therefore, in this paper, we focus on approximate range search, where the query results are approximate, rather than exact. We propose approximate static range search (ARS) which combines two approaches, namely (i) lowerbound approximate range search, and (ii) upperbound approximate range search. Using ARS, we are able to deliver a better performance, together with low false hit and reasonable false miss. We also extend ARS in the context of a continuous query setting, in which the query moves. This is particularly important in spatial databases as a mobile user who invokes the query is moving. In terms of continuous range search, the intention is to find split points—the locations where the query results will be updated. Accordingly, we propose two methods for approximate continuous range search, namely (i) range search minimization, and (ii) split points minimization. Our performance evaluation which compares our methods with the traditional continuous range search shows that our methods considerably reduce the number of split points, thereby improving overall performance.

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
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. AL-Khalidi H, Abbas Z, Safar M (2012) Approximate range query processing in spatial network databases. Multimed Syst :1–11

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Arya S, Mount DM (1993) 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

  4. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6):891–923

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  7. Chow C-Y, Mokbel MF, Naps J, Nath S (2009) 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

  8. Corral A, Ca nadas J, Vassilakopoulos M (2002) 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

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

    Article  Google Scholar 

  10. da Fonseca GD, Mount DM (2010) Approximate range searching: The absolute model. Comput Geom Theory Appl 43(4):434–444

    Article  MATH  Google Scholar 

  11. de Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

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

  16. Philippe Rigaux AV, Scholl MO (2002) Spatial databases: with application to GIS. Morgan Kaufmann, Burlington

    Google Scholar 

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

    Article  Google Scholar 

  18. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: SIGMOD ’95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, ACM. pp 71–79

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

    Google Scholar 

  20. Safar M, Ebrahimi D (2006) Edar algorithm for continuous knn queries based on pine. IJITWE 1(4): 1–21

    Google Scholar 

  21. Sedighian KS, Sharifi M (2012) Coverage rate calculation in wireless sensor networks. Computing : 1–24

  22. Sistla AP, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: Proceedings of the thirteenth international conference on data engineering ICDE ’97, pp 422–432. IEEE Computer Society

  23. Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the 7th international symposium on advances in spatial and temporal databases SSTD ’01, pp 79–96. Springer

  24. Taniar D, Leung CHC, Rahayu W, Goel S (2008) High performance parallel database processing and grid databases. Wiley Series on Parallel and Distributed Computing. Wiley, Hoboken

    Book  Google Scholar 

  25. Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the 28th international conference on Very Large Data Bases, VLDB ’02, pp 287–298. VLDB Endowment

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgments

This research has been partially funded by the Australian Research Council (ARC) Discovery Project (Project No: DP0987687). The source of our implementations can be downloaded from the following URL: http://users.monash.edu/~dtaniar/Approx-Range-Computing-Journal.

Author information

Authors and Affiliations

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

    Haidar AL-Khalidi & David Taniar

  2. Computer Engineering, Kuwait University, Kuwait City, Kuwait

    Maytham Safar

Authors
  1. Haidar AL-Khalidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Taniar
    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., Taniar, D. & Safar, M. Approximate algorithms for static and continuous range queries in mobile navigation. Computing 95, 949–976 (2013). https://doi.org/10.1007/s00607-012-0219-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-012-0219-7

Keywords

Mathematics Subject Classification

Search

Navigation