Location Based Query Processing by Anonymizer

Jency.I*
Assistant Professor, Department of Computer Science and Engineering, Ponjesly College of Engineering, Nagercoil, Kanyakumari District, Tamil Nadu, India.
Periodicity:December - February'2018
DOI : https://doi.org/10.26634/jcom.5.4.14609

Abstract

Location based query services are popular, and have a great demand. The authors have proposed a framework using Anonymous query processing to find the exact location of the places. Previous network database requires no specified storage or functions. In this paper, an anonymous query processing is utilized, where the user can send a query and get the results without leaking their identity to the server. By this anonymous technique, the user can identify the locations very easily using two types of query. This technique has achieved better performance.

Keywords

Anonymizer, Location Based Server, Spatial Region, Preprocessing, Query Processing

How to Cite this Article?

Jency, I. (2018). Location Based Query Processing by Anonymizer. i-manager’s Journal on Computer Science, 5(4), 7-13. https://doi.org/10.26634/jcom.5.4.14609

References

[1]. Aggarwal, G., Bawa, M., Ganesan, P., Garcia-Molina, H., Kenthapadi, K., Mishra, N., ... & Xu, Y. (2004, August). Vision paper: enabling privacy for the paranoids. In Proceedings of the Thirtieth International Conference on Very Large Databases (Vol. 30, pp. 708-719). VLDB Endowment.
[2]. Anusha, K. B., & Harini, M. S.(2015). A privacy policy for continuous query processing through location based services. International Journal of Computer Science and Information Technologies, 6(6), 4997-5003.
[3]. Brinkhoff, T. (2002). A framework for generating network-based moving objects. GeoInformatica, 6(2), 153-180.
[4]. Chow, C. Y., & Mokbel, M. F. (2007, July). Enabling private continuous queries for revealed user locations. In International Symposium on Spatial and Temporal Databases (pp. 258-275). Springer, Berlin, Heidelberg.
[5]. Dhikhi, T., Kapilya, G., & Vanathi, R. (2013). An Approach for spatial query processing in location based services for mobile environment. International Journal of Engineering and Technology, 5(5), 3685- 3691.
[6]. Ku, W. S., Chen, Y., & Zimmermann, R. (2009). Privacy protected spatial query processing for advanced location based services. Wireless Personal Communications, 51(1), 53-65.
[7]. Liu, J., Yang, J., Xiong, L., & Pei, J. (2017, April). Secure skyline queries on cloud platform. In Data Engineering rd (ICDE), 2017 IEEE 33 International Conference on (pp. 633-644). IEEE.
[8]. Liu, S., Liu, A., Zhao, L., Liu, G., Li, Z., Zhao, P., ... & Qin, L. (2016, April). Efficient query processing with mutual privacy protection for location-based services. In International Conference on Database Systems for Advanced Applications (pp. 299-313). Springer, Cham.
[9]. Mokbel, M. F. (2006). Towards privacy-aware locationbased database servers. In Data Engineering Workshops, nd 2006. Proceedings. 22 International Conference on (pp. 93-93). IEEE.
[10]. Mouratidis, K., & Yiu, M. L. (2010). Anonymous query processing in road networks. IEEE Transactions on Knowledge and Data Engineering, 22(1), 2-15.
[11]. Pradhan, P., Naik, A., & Patel, P. (2014). Location Privacy in Ubiquitous Computing. International Journal of Research in Science and Technology, 2(4).
[12]. Wang, H., & Zimmermann, R. (2007). Locationbased query processing on moving objects in road networks. In Proc. Intl. Conf. on Very Large Data Bases (VLDB 2007) (pp. 321-332).
[13]. Warneke, D., & Kao, O. (2011). Exploiting dynamic resource allocation for efficient parallel data processing in the cloud. IEEE Transactions on Parallel Distributed Systems (Vol. 22, No. 6, pp. 985-997). IEEE.
[14]. Yi, X., Paulet, R., Bertino, E., & Varadharajan, V. (2016). Practical approximate k nearest neighbor queries with location and query privacy. IEEE Transactions on Knowledge and Data Engineering, 28(6), 1546-1559.

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

If you have access to this article please login to view the article or kindly login to purchase the article
Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.