Predictive Query Indexing for Ambiguous Moving Objects in Uncertain Data Mining

Gowri SreeLakshmi Neeli, Kesavarao Seerapu

Abstract


Indexing and query processing is a developing examination field in spatio-temporal data. The majority of the continuous applications, for example, area based administrations, armada administration, movement expectation and radio recurrence recognizable proof and sensor systems depend on spatiotemporal indexing and query preparing. All the indexing and query processing applications is any of the structures, for example, spatio file get to and supporting inquiries or spatio-transient indexing technique and bolster query or temporal measurement, while in spatial data it is considered as the second need. The majority of the current overview takes a shot at spatio-fleeting depend on indexing techniques and query preparing, yet exhibited independently. Probabilistic range query is an essential kind of query in the region of dubious data administration. A probabilistic range query restores every one of the articles inside a particular range from the query question with a likelihood no not as much as a given edge. A query protest is either a specific question or an indeterminate question demonstrated by a Gaussian appropriation. We propose a few sifting systems and a U-tree-based list to effectively bolster probabilistic range questions over Gaussian items. Broad tests on genuine data exhibit the proficiency of our proposed approach.


Keywords


Uncertain Data, Constrained space, probabilistic range query, uncertain moving objects, obstacles, query processing.

References


Overmars, Computational Geometry: Algorithms and Applications, 3rd Ed. Berlin, Germany: Springer, 2008.

B. Braden, “The surveyor’s area formula,” College Math. J., vol. 17, no. 4, pp. 326–337, 1986.

J. Chen and R. Cheng, “Efficient evaluation of imprecise location dependent queries,” in Proc. IEEE Int. Conf. Data Eng., 2007, pp. 586–595.

R. Cheng, D. V. Kalashnikov, and S. Prabhakar, “Querying imprecise data in moving object environments,” IEEE Trans. Knowl. Data Eng., vol. 16, no. 9, pp. 1112–1127, 2004.

B.S. E. Chung, W.-C. Lee, and A. L. P. Chen, “Processing probabilistic spatio-temporal range queries over moving objects with uncertainty,” in Proc. Int. Conf. Extending Database Technol., 2009, pp. 60–71.

T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Z€ufle, “Querying uncertain spatio-temporal data,” in Proc. IEEE Int. Conf. Data Eng., 2012, pp. 354–365.

B. Gedik, K.-L. Wu, P. S. Yu, and L. Liu, “Processing moving queries over moving objects using motion-adaptive indexes,” IEEE Trans. Knowl. Data Eng., vol. 18, no. 5, pp. 651–668, 2006.

G. Greiner and K. Hormannn, “Efficient clipping of arbitrary polygons,” ACM Trans. Graph., vol. 17, no. 2, pp. 71–83, 1998.

K. Hormann and A. Agathos, “The point in polygon problem for arbitrary polygons,” Comput. Geometry, vol. 20, no. 3, pp. 131–144, 2001.

H. Hu, J. Xu, and D. L. Lee, “A generic framework for monitoring continuous spatial queries over moving objects,” ACM Int. Conf. Manag. Data, 2005, pp. 479–490.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.