Skip to main content
SpringerLink
Log in

An Efficient Information System for Providing Location Based Services in Network Environments

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In information retrieval systems, the location information can be collected by using Global Positioning Systems for providing Location Based Services (LBS) to the information system users. The LBS can be either person-oriented or device-oriented. In the person-oriented approach, the LBS focuses on the location of the user and the user can control the services provided by the service provider. In the device-oriented approach, the LBS focuses on the object and it is not controlled by the mobile user. The LBS also manages Points of Interest (POI) of mobile users in order to perform effective route finding for providing the services fast. Moreover, the users of mobile devices tend to query based on Points of Interest such as for restaurants and markets where the users can query based on its attributes like price, type of food, user ratings which are close to their current location. The POI is calculated primarily on the interest of mobile users and the ratings given by existing user’s with their feedback. The users can select the features to obtain specific objects. In this paper, a new information retrieval model is proposed for improving the performance of information systems by providing new data structures and algorithms for storage and retrieval of data. The primary idea behind this work is to minimize the number of user requests and to achieve high accuracy for the user’s query result by using an information repository called as the Path Log. The Path Log is used to store the information about the search time and distance of the service provider locations by providing an optimal route to serve the users information request. For this purpose, a new spatial indexing is used in this work to obtain an accurate and optimal path to reach the location of the services. The tree has been constructed by giving weights for the leaf nodes. Thus the solution proposed in this work for providing LBS is achieved by processing the K-Nearest Neighbor and Range queries such that the user requests for information retrieval is carried out more optimally.

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.

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

Similar content being viewed by others

References

  1. Prabha, S., Kannan, A., & Anandhakumar, P. (2006). An optimizing query processor with an efficient caching mechanism for distributed databases. The International Arab Journal of Information Technology,3(3), 231–236.

    Google Scholar 

  2. Zhang, D., Chow, C. Y., Li, Q., Zhang, X., & Xu, Y. (2012). SMashQ: Spatial mashup framework for k-NN queries in time dependent road networks. Distributed Parallel Databases,31(2), 259–287.

    Article  Google Scholar 

  3. Kanoulas, E., Du, Y., Xia, T., & Zhang, D. (2006). Finding fastest paths on a road network with speed patterns. In Proceeding: International conference data engineering (ICDE), (Vol 18, pp. 451–463).

  4. AnandhaKumar P., Raja M. B., & Kannan, A. (2005). Partial image retrieval system using sub tree matching. In Proceeding ICAI’05/MCB’05/AMTA’05/MCBE’05, pp. 281–286.

  5. Chan, E. P. F., & Yang, Y. (2009). Shortest path tree computation in dynamic graphs. IEEE Transaction on Computer,58(4), 541–557.

    Article  MathSciNet  Google Scholar 

  6. Samar, P., Pearlman, M. R., & Haas, Z. J. (2004). Independent zone routing: An adaptive hybrid routing framework for adhoc wireless networks. IEEE/ACM Transactions on Networking,12(4), 595–608.

    Article  Google Scholar 

  7. Kriegel, H. P., Kreoger, P., Renz, M., & Schmidt, T. (2007) Proximity queries in large traffic networks. In Proceeding: 15th annual ACM international symposium in advanced geographic information system, p. 21.

  8. Li, Y., & Yiu, M. L. (2015). Route-saver: Leveraging route APIs for accurate and efficient query processing at location-based services. IEEE Transactions on Knowledge and Data Engineering,27(1), 235–249.

    Article  Google Scholar 

  9. Sankaranarayanan, J., & Samet, H. (2009). Distance oracles for spatial networks. In Proceeding: IEEE international conference in data engineering (Vol. 55, pp. 652–663).

  10. Qiao, M., Cheng, H., Chang, L., & Yu, J. X (2012). Approximate shortest distance computing: A query-dependent local landmark scheme. In Proceeding: IEEE 28th international conference in data engineering, pp. 462–473.

  11. Zhong, R., Li, G., Tan, K. L., & Zhou, L. (2013). G-tree: An efficient index for KNN search on road networks. In Proceeding: 22nd ACM international conference information on knowledge management, pp. 39–48.

  12. Mouratidis, K., Yiu, M. L., Papadias, D., & Mamoulis, N. (2006) Continuous nearest neighbor monitoring in road networks. In Proceedings of 32nd international conference in very large data bases (VLDB), pp. 43–54.

  13. Samet, H., Sankaranarayanan, J., & Alborzi, H. (2008) Scalable network distance browsing in spatial databases. In Proceeding: ACM SIGMOD international conference in management data, pp. 43–54.

  14. Papadias, D., Zhang, J., Mamoulis, N., & Tao, Y (2003) Query processing in spatial network databases. In Proceedings of international conference in very large data bases (VLDB), pp. 802–813.

  15. Thomsen, J. R., Yiu, M. L., & Jensen, C. S (2012). Effective caching of shortest paths for location-based services. In Proceeding: ACM SIGMOD international conference management data, pp. 313–324.

  16. Yiu, M. L., Mamoulis, N., & Papadias, D. (2005). Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering,17(6), 820–833.

    Article  Google Scholar 

  17. Vijayalakshmi, M., & Kannan, A. (2007). Processing location dependent continuous queries in distributed mobile databases using mobile agents. In IET -UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007), pp. 1023–1030.

  18. Geetha, K., & Kannan, A. (2014). Optimizing the spatial query processing with a proxy-based approach. In IEEE sixth international conference on advanced computing, pp. 77–81.

  19. Lee, K. C., Lee, W.-C., Zheng, B., & Tian, Y. (2012). ROAD: A new spatial object search framework for road networks. IEEE Transactions on Knowledge and Data Engineering,24(3), 547–560.

    Article  Google Scholar 

  20. Muthurajkumar, S., Vijayalakshmi, M., & Kannan, A. (2017). Secured data storage and retrieval algorithm using map reduce techniques and chaining encryption in cloud databases. Wireless Personal Communications,96(4), 5621–5633.

    Article  Google Scholar 

  21. Haapasalo, T., Jaluta, I., Sippu, S., & Soisalon-Soininen, E. (2013). On the recovery of R-trees. IEEE Transactions on Knowledge and Data Engineering,25(1), 145–157.

    Article  Google Scholar 

  22. Muthurajkumar, S., Ganapathy, S., Vijayalakshmi, M., & Kannan, A. (2017). An intelligent secured and energy efficient routing algorithm for MANETs. Wireless Personal Communications,96(2), 1753–1769.

    Article  Google Scholar 

  23. Selvakumar, K., Sai Ramesh, L., & Kannan, A. (2017). An intelligent energy aware secured algorithm for routing in wireless sensor networks. Wireless Personal Communications,96(3), 4781–4798.

    Article  Google Scholar 

  24. Kriegel, H. P., Kreoger, P., Renz, M., & Schmidt, T., Hierarchical graph embedding for efficient query processing in very large traffic networks. In Proceeding: 20th international conference in scientific statistics in database management (Vol. 23, pp. 150–167).

  25. Shang, S., Zheng, K., Jensen, C. S., Yang, B., Kalnis, P., Li, G., et al. (2015). Collective travel planning in spatial networks. IEEE Transactions on Knowledge and Data Engineering,27(6), 1505–1518.

    Article  Google Scholar 

  26. Yiu, M. L., & Lu, H. (2011). Ranking Spatial Data Quality Preferences. IEEE Transactions on Knowledge and Data Engineering,23(3), 433–446.

    Article  Google Scholar 

  27. Kriegel, H.-P., Pfeifle, M., Pötke, M., & Seidl, T (2003). Spatial query processing for high resolutions. In Proceedings of 8th international conferences on database systems for advanced applications, Japan.

  28. Han, J., Kamber, M., Pei, J. (2012). Data mining: Concepts and techniques. 3rd Edition, The Morgan Kaufmann series in data management systems.

  29. Zhang, D., Chow, C. Y., Li, Q., Zhang, X., & Xu, Y. (2011). Efficient evaluation of k-NN queries using spatial mashups. In Proceedings of 12th international conference in advanced spatial temporal databases (ICASTD) (Vol. 72, pp. 348–366).

Download references

Author information

Authors and Affiliations

  1. Department of Information Science and Engineering, Anna University, Chennai, India

    K. Geetha & A. Kannan

Authors
  1. K. Geetha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Geetha.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Geetha, K., Kannan, A. An Efficient Information System for Providing Location Based Services in Network Environments. Wireless Pers Commun 109, 2377–2398 (2019). https://doi.org/10.1007/s11277-019-06686-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06686-3

Keywords

Search

Navigation