Using Rank Based KNN Queries Processing to Reduce Location Uncertainty in Wireless Sensor Networks – Term Paper Example

Download full paperFile format: .doc, available for editing

The paper “ Using Rank Based KNN Queries Processing to Reduce Location Uncertainty in Wireless Sensor Networks” is a   forceful variant of term paper on engineering. Imprecise or uncertain data are very common in a number of applications nowadays and this has contributed to the growth of several uncertain database frameworks. Since the k-nearest neighbor (KNN) query is a very important issue in a number of applications, it has been broadly studied. The main aim of this paper is to study the issue of KNN query processing over uncertain data.

To achieve this, I used the expected rank technique to work out KNN. Randomized and exact techniques integrating efficient IO accessing and object pruning techniques were formulated to process queries modeled by uncertain regions or query points. General experiments were carried out on both synthetic and real data to show the efficiency of randomized and exact approaches. Using Rank Based KNN Queries Processing to Reduce Location Uncertainty in Wireless Sensor NetworksIndex Terms— exact technique, expected rank, k-nearest neighbor query, and randomized technique. INTRODUCTIONRapid improvements in positioning technologies, such as wireless communications and Global Positioning System (GPS), have made it possible to track continuously moving objects.

A number of applications may benefit from the growth of such tracking technologies. The advancements of sensors and wireless technology have supported the wide use of sensor systems or networks. Query processing and data collection in a sensor network are challenging research areas in sensor network database management. A number of applications that deal with such data have to come to terms with imprecise or uncertain data. In the vast majority of the evolving applications, the basic datasets are regularly imprecise or uncertain.

There are variations in the sources of uncertainty data among different applications. Privacy preservation, limitations of the devices, delay on data updates, and data incompleteness and randomness are some of the causes of uncertainty data in some applications. Therefore, it is an essential thing for the database community to come up with ways of efficiently handling uncertain data. As the number of applications that employ Spatio-temporal data sets is increasing, it is very important to develop efficient query processing techniques for these applications. In Spatio-temporal databases, the K-Nearest Neighbor (KNN) query is a very important query.

KNN query has been employed in a number of applications including facial pattern recognition, sensor network, traffic network analysis, and location-based services. On the other hand, the data uncertainty in these applications contributes to incorrect results. KNN query over imprecise data is very essential as it is employed in a number of real-life applications. Processing of KNN queries in large Spatio-temporal databases has been extensively examined preciously, but only a few studies have concentrated on uncertain data. To handle the growing needs of providing high-quality services and managing data uncertainty, researchers have suggested the use of “ uncertain databases, ” in which uncertainty is given priority.

Specifically, the uncertain data is assessed through probabilistic queries, which provides solutions with statistical and probabilistic assurance. A data model that is widely used and adopted in databases with uncertainty is the attribute uncertainty, in which the real attribute measure is situated in the uncertainty region or inside a closed region. The probabilistic database in the Attribute-level uncertainty model is an N tuples table. Every tuple has a single attribute with uncertain value.

Each attribute with uncertainty has a discrete pdf defining its distribution. When representing this imprecise association to a given instance, all the tuples draw values for their uncertain attribute in accordance with the related discrete pdf and the selection is not dependent amongst the tuples. A number of studies have described the nearest neighbor (NN) query over data uncertainty as a Probabilistic Nearest Neighbor (PNN) based query, which positions objects with uncertainty according to their probabilities of being a query q nearest neighbor. In other studies, the ranking of uncertain data is based on the U-top and expected score.

The effectiveness of the two semantics is evaluated using five important properties namely: stability, value invariance, unique ranking, containment, and exact-k. The U-top semantic does not satisfy the containment and exact-k properties, while the expected score ranking is responsive to the values and therefore it goes against the property of value invariance. The expected rank suggested meets all the properties that are mentioned above and this motivated me to apply it in this paper to rank objects with uncertainty for KNN queries.

Though I am applying this technique, applying directly as it has been done does not result in effective answers for the KNN queries over imprecise data. This paper will come up with the CPU and IO time-efficient algorithm that will be used to get the expected rank based KNN. The semantic of the KNN query used in this paper varies from the one used in and. The techniques used in and cannot apply in this paper as in, the technique just considers the distance in L1 and in the technique presume that there is a distribution of the distance between the object with uncertainty and a query point.        

REFERENCES

[1] K. Yi, F. Li, G. Kollios and D. Srivastava, "Efficient processing of top-k queries in uncertain databases," in ICDE, 2008.

[2] Y.-P. Chi and H.-P. Chang, "An energy-aware grid-based routing scheme for wireless sensor networks," Telecommunication Systems, vol. 54, no. 4, pp. 405-415, 2013.

[3] G. Trajcevski, R. Tamassia, I. F. Cruz, P. Scheuermann, D. Hartglass, and C. Zamierowski, "Ranking continuous nearest neighbors for uncertain trajectories," VLDB J, vol. 20, no. 5, pp. 767-791, 2011.

[4] N. Ailon, "A simple linear ranking algorithm using query dependent intercept variables," Google Research, New York, 2009.

[5] C. Xu, Y. Gu, L. Chen, J. Qiao and G. Yu, "Interval reverse nearest neighbor queries on uncertain data with Markov correlations," in Proc. ICDE, 2013.

[6] M. A. Soliman, I. F. Ilyas and C. K. Chen-Chuan, "Top-k query processing in uncertain databases," in ICDE 2007, 23rd International Conference on Data Engineering, Istanbul, 2007.

[7] C. R, J. Chen, M. M, and C.-Y. Chow, "Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data," in ICDE 2008, IEEE 24th International Conference on Data Engineering, Cancun, 2008.

[8] J. Niedermayer, A. Zufle, T. Emrich, M. Renz, N. Mamoulis, L. Chen, and H.-P. Kriegel, "Probabilistic nearest neighbor queries on uncertain moving object trajectories," in Proceedings of the VLDB Endowment, Hangzhou, China, 2014.

[9] X. Lian and L. Chen, "Probabilistic group nearest neighbor queries in uncertain databases," Knowledge and Data Engineering, vol. 20, no. 6, pp. 809-824, 2008.

[10] G. Beskales, M. A. Soliman and I. F. Ilyas, "Efficient search for the top-k probable nearest neighbors in uncertain databases," in Proceedings in VLDB Endowment, Auckland, New Zealand, 2008.

[11] J. Winter, Y. Xu and W.-C. Lee, "Energy-efficient processing of K nearest neighbor queries in location-aware sensor networks," in The Second International Conference on Mobile and Ubiquitous Systems: Networking and Services (Mobiquitous'05), San Diego, 2005.

[12] S. Cabello and M. J. van Kreveld, "Approximation algorithms for aligning points," in Symposium on Computational Geometry, 2003.

[13] X. Geng, T.-Y. Liu, T. Qin, A. Arnold, H. Li, and H.-Y. Shum, "Query dependent ranking using k-nearest neighbor," in Microsoft Research, 2008.

[14] R. Cheng, D. V. Kalashnikov and S. Prabhakar, "Evaluating probabilistic queries over imprecise data," in SIGMOD Conference, 2003.

[15] L. Antova, C. Koch and D. Olteanu, "Query language support for incomplete information in the maybes system," in VLDB, 2007.

[16] O. Benjelloun, A. D. Sarma, A. Y. Halevy and J. Widom, "Uldbs: Databases with uncertainty and lineage," in VLDB, 2006.

[17] G. Cormode, F. Li and K. Yi, "Semantics of ranking queries for probabilistic data and expected ranks," in ICDE, 2009.

[18] N. N. Dalvi and D. Suciu, "Efficiency query evaluation on probabilistic databases," in VLDB, 2004.

[19] Y. Zhang, X. Lin, G. Zhu, W. Zhang, and Q. Lin, "Efficient rank based KNN query processing over uncertain data," in 2010 IEEE 26th International Conference on Data Engineering (ICDE), Long Beach, CA, 2010.

[20] G. Li, Y. Li, L. Shu, and P. Fan, "Cnn query processing over moving objects with uncertain speeds in road networks," in APWeb, 2011.

[21] V. Ljosa and A. K. Singh, "APLA: Inbdexing arbitrary probability distributions," in 2007 ICDE, IEEE 23rd International Conference on Data Engineering, Istanbul, 2007.

[22] R. Cheng, L. Chen, J. Chen and X. Xie, "Evaluating probability threshold k-nearest-neighbor queries over uncertain data," in EDBT, 2009.

[23] A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, "Modeling and querying moving objects," in Proceeding of the International Conference on Data Engineering, Birmingham, UK, 1997.

[24] Y. Tao and D. Papadias, "Time parametrized queries in Spatio-temporal databases," in Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, WI, USA, 2002.

[25] D. V. Kalashnikov, S. Prabhakar, S. Hambrusch, and W. Aref, "Efficient evaluation of continuous range queries on moving objects," in Proceedings of the International Conference on Database and Expert Systems Applications, Aix en, France, 2002.

[26] R. Benetis, C. S. Jensen, G. Karciauskas and S. Saltines, "Nearest neighbor and reverse nearest neighbor queries for moving objects," in Proceedings of the International Database Engineering and Applications Symposium, Edmonton, Canada, 2002.

[27] K. Raptopoulou, A. N. Papadopoulos and Y. Manolopoulos, "Fast nearest-neighbor query processing in moving object databases," GeoInformatica, vol. 7, no. 1, pp. 113-137, 2003.

[28] G. Iwerks, H. Samet, and K. Smith, "Continuous K-nearest neighbor queries for continuously moving points with updates," in Proceedings of the International Conference on Very Large Databases, Berlin, Germany, 2003.

[29] Z. Song and N. Roussopoulos, "K-nearest neighbor search for moving query point," in Proceedings of the 7th International Symposium on advances in spatial and temporal databases, Redondo Beach, CA, USA, 2001.

[30] R. V. Nehme and E. A. Rundensteiner, "SCUBA: Scalable Cluster-Based Algorithm for evaluating continuous Spatio-temporal queries on moving objects," in Proceedings of the 10th International Conference on Extending Database Technology, Munich, Germany, 2006.

[31] Y. Han, J. Tang, Z. Zhou, M. Xiao, L. Sun, and Q. Wang, "Novel itinerary-based KNN query algorithm leveraging grid division routing in wireless sensor networks of skewness distribution," Personal and Ubiquitous Computing, vol. 18, no. 8, pp. 1989-2001, 2014.

[32] X. Zhang and J. Chomicki, "On the semantics and evaluation of top-k queries in probabilistic databases," in DBRank, 2008.

[33] W. Zhang, "Nearest neighbor searching under uncertainty," in RIP Proposal, 2011.

[34] S. M. Yuen, Y. Tao, X. Xiao, J. Pei, and D. Zhang, "Superseding nearest neighbor search on uncertain spatial databases," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 1041-1055, 2010.

[35] J. Li and A. Deshpande, "Ranking continuous probabilistic datasets," in Proceedings of the VLDB Endowment, Singapore, 2010.

[36] H.-P. Kriegel, P. Kunath, and M. Renz, "Probabilistic nearest-neighbor query on uncertain objects," in 12th International Conference on Database systems of Advanced Applications (DASFAA 2007), Munich, 2007.

[37] M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: A probabilistic threshold approach," in Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD'08, New York, NY, USA, 2008.

[38] A. Stupar, S. Michel, and R. Schenkel, "RankReduce - Processing k-nearest neighbor query on top of MapReduce," in LSDS-IR, Geneva, Switzerland, 2010.

Download full paperFile format: .doc, available for editing
Contact Us