Skip to main content
SpringerLink
Log in

Efficient Algorithm for Finding Aggregate Nearest Place Between Two Users

  • Conference paper
  • First Online:
Genetic and Evolutionary Computing (ICGEC 2016)

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

Included in the following conference series:

  • 846 Accesses

Abstract

Keyword search over a large amount of data is an important operation in a wide range of domains. Spatial keyword search on spatial database has been well studied for years due to its importance to commercial search engines. Specially, a spatial keyword query takes a user location and user-supplied keywords as arguments and returns object that is nearest k objects from user current location and textually relevant to the user required keyword. Geo-textual index structure plays an important role in spatial keyword querying. This paper proposes the geo-textual index structure that intends to reduce unnecessary cost in processing spatial keyword queries and searching time for required results. The proposed index is used for searching most relevance results between two users that is based on the most spatial and textual relevance to query point and required keyword within given range. It can search the required result point with minimum IO costs and CPU costs. In this system, we also discuss how to answer inconsistencies and errors in the user’s typed queries.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

References

  1. Aung, S.N., Sein, M.M.: Hybrid geo-textual index structure for spatial range keyword search. Proc. Comput. Sci. Eng. Int. J. (CSEIJ) 4(5/6), 21–28 (2014)

    Google Scholar 

  2. Aung, S.N., Sein, M.M.: Geo-textual index structure for approximate keyword search within given range on spatial database. In: Proceedings of 7th International Conference on Science, Technology, Engineering and Management (ICSTEM 2015), Singapore, pp. 49–54, January 2015

    Google Scholar 

  3. Aung, S.N., Sein, M.M.: Modify compact R-tree dynamic index structure for myanmar GIS database. In: ICCA2014, Yangon, Myanmar, pp. 201–204, February 2014

    Google Scholar 

  4. Aung, S.N., Sein, M.M.: Efficient combined index structure for K-nearest neighbors keyword search on spatial database. In: Proceedings of the 13th International Conference on Computer Applications, Yangon, Myanmar, pp. 324–328, February 2015

    Google Scholar 

  5. Aung, S.N., Sein, M.M.: K-nearest neighbours approximate keyword search for spatial database. Proc. Int. J. Adv. Electron. Comput. Sci. (IJAECS) 2(4), April 2015. ISSN:2393-2835

    Google Scholar 

  6. Aung, S.N., Sein, M.M.: Index structure for nearest neighbors search with required keywords on spatial database. In: Zin, T.T., Lin, J.-W., Pan, J.-S., Tin, P., Yokota, M. (eds.) Genetic and Evolutionary Computing. AISC, vol. 388, pp. 457–467. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  7. Aung, S.N.: Nearest neighbor public services search system for myanmar land. In: ICT Virtual Organization of ASEAN Institutes and NICT Forum 2015, Kuala Lumpur, Malaysia, 26 November 2015

    Google Scholar 

  8. Aung, S.N.: Finding nearest services for emergency cases. In: Workshop on ICT Application for Responding Natural Disasters and Environmental Changes, Yangon, Myanmar, 22 January 2015

    Google Scholar 

  9. Ohsawa, Y., Htoo, H., Nyunt, N.J., Sein, M.M.: Generalized bichromatic homogeneous vicinity query algorithm in road network distance. In: Morzy, T., Valduriez, P., Bellatreche, L. (eds.) ADBIS 2015. CCIS, vol. 539, pp. 60–67. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23201-0

    Chapter  Google Scholar 

  10. Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Aggregate nearest neighbor search methods using SSMTA* algorithm on road-network. In: Morzy, T., Härder, T., Wrembel, R. (eds.) ADBIS 2012. LNCS, vol. 7503, pp. 181–194. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Zhang, D., Tan, K.L., Tung, A.K.H.: Scalable Top-K spatial keyword search. In: EDBT/ICDT 2013, 18–22 March 2013

    Google Scholar 

  12. Chen, L., Cong, G., Jensen, C.S., Wu, D.: Spatial keyword query processing: an experimental evaluation. In: Proceedings of the VLDB Endowment, vol.6, no.3 (2013)

    Google Scholar 

  13. Cao, X., Chen, L., Cong, G., Jensen, C.S., Qu, Q., Skovsgaard, A., Wu, D., Yiu, M.L.: Spatial keyword querying. In: Atzeni, P., Cheung, D., Ram, S. (eds.) ER 2012 Main Conference 2012. LNCS, vol. 7532, pp. 16–29. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Rocha-Junior, J.B., Gkorgkas, O., Jonassen, S., Nørvåg, K.: Efficient processing of top-k spatial keyword queries. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 205–222. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Li, Z., Lee, K.C.K., Zheng, B., Lee, W.-C., Lee, D.L., Wang, X.: Ir-tree: An efficient index for geographic document search. IEEE TKDE 23(4), 585–599 (2011)

    Google Scholar 

  16. Zhou, Y., Xie, X., Wang, C., Gong, Y., Ma, W.-Y.: Hybrid index structures for location-based web search. In: CIKM, pp. 155–162 (2005)

    Google Scholar 

  17. Göbel, R., Henrich, A., Niemann, R., Blank, D.: A hybrid index structure for geo-textual searches. In: CIKM, pp. 1625–1628 (2009)

    Google Scholar 

  18. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Computer Studies, Yangon, Myanmar

    Su Nandar Aung & Myint Myint Sein

Authors
  1. Su Nandar Aung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myint Myint Sein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Su Nandar Aung .

Editor information

Editors and Affiliations

  1. College of Information Science and Engineering, Fujian University of Technology, Fuzhou, Fujian, China

    Jeng-Shyang Pan

  2. School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, Guangdong, China

    Jerry Chun-Wei Lin

  3. College of Information Science and Engineering, Fujian University of Technology, Fuzhou, Fujian, China

    Chia-Hung Wang

  4. College of Information Science and Engineering, Fujian University of Technology, Fuzhou, Fujian, China

    Xin Hua Jiang

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Aung, S.N., Sein, M.M. (2017). Efficient Algorithm for Finding Aggregate Nearest Place Between Two Users. In: Pan, JS., Lin, JW., Wang, CH., Jiang, X. (eds) Genetic and Evolutionary Computing. ICGEC 2016. Advances in Intelligent Systems and Computing, vol 536. Springer, Cham. https://doi.org/10.1007/978-3-319-48490-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48490-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48489-1

  • Online ISBN: 978-3-319-48490-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation