期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2012
卷号：2
期号：1
页码：343-346
出版社：International Journal of Soft Computing & Engineering
摘要：In moving object environment, it’s unfeasible for database to track the random object movement and to store the locations of object exactly all the times. The basic issue in case of moving object monitoring is efficiency and privacy. We used a framework for moving object to hide their own identities by execution of probabilistic range monitoring queries. The Privacy-aware monitoring framework for spatial join queries which is flexible, it addresses two issues; such as “efficiency and privacy” in monitoring moving object. Because of blurring exact position of object and increase in unnecessary updates costs it’s not possible to provide accurate result. So, we propose an efficient processing of continuously moving top-k spatial keyword (MkSK) queries over spatial query processing for the problem of privacy aware monitoring framework. This develop an efficient query processing, evaluation and reevaluation based on spatial queries which could be effective for computing safe zones that guarantee correct results until the user remains in safe zone, the reported results will be valid and no limiting of frequent updates from objects. The Voronoi Cell Optimization technique which accelerates depth sorting by clustering polygon has been implemented. Our solution is common for moving queries employ safe zones. In our performance study, we compare it with an existing approach using simulation. Our proposed approach outperforms than the conventional approaches without compromising much on the concept of safe zone to save computation and communication costs.
