Skip to main content

Nearest Neighborhood Determination Methods with Regard to Mobile Location-Based Application

  • Conference paper
  • First Online:
  • 1291 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 655))

Abstract

The paper concerns nearest neighborhood determination issues. The main goal is to investigate and compare characteristics of popular solutions with regard to applying them to location-based services for mobile devices. Mainly the impact of number of objects and object’s mobility on performance is considered. Also the accuracy dependent on search range was tested. The paper takes into account three groups of approaches: brute-force based solutions, spatial tree structures, and solutions that use Geohash for location encoding. Described simulation experiments was performed for eight popular algorithms and one own approach. The results show very diverse properties of all algorithms and its usefulness for considered area of application.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Malm, A.: Mobile Location-Based Services, 9th edn. Berg Insight AB (2015)

    Google Scholar 

  2. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM Management of Data (SIGMOD), pp. 47–57 (1984)

    Google Scholar 

  3. Vincenty, T.: Direct and inverse solutions of geodesics on the ellipsoid with application of nested equations (1975)

    Google Scholar 

  4. Great Britain: Ministry of Defence, Admiralty Manual of Navigation, vol. 1. Stationery Office, London (1997)

    Google Scholar 

  5. Salonen, J.: Geographic Distance Can Be Simple and Fast (2014). http://jonisalonen.com/2014/computing-distance-between-coordinates-can-be-simple-and-fast accessed 31 Jul 2017

  6. Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974). Springer, New York

    Article  MATH  Google Scholar 

  7. Hjaltason, G.R., Samet, H.: Speeding up construction of PMR quadtree-based spatial indexes. VLDB J. 11(2), 109–137 (2002)

    Article  Google Scholar 

  8. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings, SODA 1997. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, pp. 360–369 (1997)

    Google Scholar 

  9. Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley, Boston (2011)

    Google Scholar 

  10. Comer, D.: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2), 121–137 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mariusz Fraś .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Fraś, M., Frącek, P., Waśko, K. (2018). Nearest Neighborhood Determination Methods with Regard to Mobile Location-Based Application. In: Borzemski, L., Świątek, J., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017. ISAT 2017. Advances in Intelligent Systems and Computing, vol 655. Springer, Cham. https://doi.org/10.1007/978-3-319-67220-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67220-5_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67219-9

  • Online ISBN: 978-3-319-67220-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics