Johannes Niedermayer
Lei Chen
Abstract
Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their applications in spatio-temporal data analysis. More recent work has considered the realistic case where the trajectories are uncertain; however, only simple uncertainty models have been proposed, which do not allow for accurate probabilistic search. In this paper, we fill this gap by addressing probabilistic nearest neighbor queries in databases with uncertain trajectories modeled by stochastic processes, specifically the Markov chain model. We study three nearest neighbor query semantics that take as input a query state or trajectory q and a time interval, and theoretically evaluate their runtime complexity. Furthermore we propose a sampling approach which uses Bayesian inference to guarantee that sampled trajectories conform to the observation data stored in the database. This sampling approach can be used in Monte-Carlo based approximation solutions. We include an extensive experimental study to support our theoretical results.
- C. Ré, J. Letchner, M. Balazinksa, and D. Suciu, "Event queries on correlated probabilistic streams," in Proc. SIGMOD, 2008, pp. 715--728. Google Scholar
Digital Library
- E. Cho, S. A. Myers, and J. Leskovec., "Friendship and mobility: User movement in location-based social networks," in Proc. KDD, 2001. Google ScholarDigital Library
- J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, and Y. Huang, "T-drive: Driving directions based on taxi trajectories," in Proc. ACM GIS, 2010. Google ScholarDigital Library
- Y. Zheng, Q. Li, Y. Chen, X. Xie, and W. Ma., "Understanding mobility based on gps data." in Proc. Ubicomp, 2008, pp. 312--312. Google ScholarDigital Library
- E. Frentzos, K. Gratsias, N. Pelekis, and Y. Theodoridis, "Algorithms for nearest neighbor search on moving object trajectories," Geoinformatica, vol. 11, no. 2, pp. 159--193, 2007. Google ScholarDigital Library
- R. H. Güting, T. Behr, and J. Xu, "Efficient k-nearest neighbor search on moving object trajectories," VLDB J., vol. 19, no. 5, pp. 687--714, 2010. Google ScholarDigital Library
- G. S. Iwerks, H. Samet, and K. Smith, "Continuous k-nearest neighbor queries for continuously moving points with updates," in VLDB, 2003, pp. 512--523. Google ScholarDigital Library
- Y. Tao, D. Papadias, and Q. Shen, "Continuous nearest neighbor search," in Proc. VLDB, 2002, pp. 287--298. Google ScholarDigital Library
- Y. Tao, C. Faloutsos, D. Papadias, and B. Liu, "Prediction and indexing of moving objects with unknown motion patterns," in Proc. SIGMOD, 2004, pp. 611--622. Google ScholarDigital Library
- X. Yu, K. Q. Pu, and N. Koudas, "Monitoring k-nearest neighbor queries over moving objects," in Proc. ICDE, 2005, pp. 631--642. Google ScholarDigital Library
- X. Xiong, M. F. Mokbel, and W. G. Aref, "Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases," in Proc. ICDE, 2005, pp. 643--654. Google ScholarDigital Library
- H. Mokhtar and J. Su, "Universal trajectory queries for moving object databases," in Proc. MDM, 2004, pp. 133--144.Google Scholar
- G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain, "Managing uncertainty in moving objects databases," ACM Trans. Database Syst., vol. 29, no. 3, pp. 463--507, 2004. Google ScholarDigital Library
- G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I. F. Cruz, "Continuous probabilistic nearest-neighbor queries for uncertain trajectories," in Proc. EDBT, 2009, pp. 874--885. Google ScholarDigital Library
- T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Züfle, "Querying uncertain spatio-temporal data," in Proc. ICDE, 2012, pp. 354--365. Google ScholarDigital Library
- G. Trajcevski, A. N. Choudhary, O. Wolfson, L. Ye, and G. Li, "Uncertain range queries for necklaces," in Proc. MDM, 2010, pp. 199--208. Google ScholarDigital Library
- R. Cheng, D. Kalashnikov, and S. Prabhakar, "Querying imprecise data in moving object environments," in IEEE TKDE, vol. 16, no. 9, 2004, pp. 1112--1127. Google ScholarDigital Library
- S. Qiao, C. Tang, H. Jin, T. Long, S. Dai, Y. Ku, and M. Chau, "Putmode: prediction of uncertain trajectories in moving objects databases," Appl. Intell., vol. 33, no. 3, pp. 370--386, 2010. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- G. Kollios, D. Gunopulos, and V. Tsotras, "Nearest neighbor queries in a mobile environment," in Spatio-Temporal Database Management. Springer, 1999, pp. 119--134. Google ScholarDigital Library
- A. Prasad Sistla, O. Wolfson, S. Chamberlain, and S. Dao, "Modeling and querying moving objects," in Proc. ICDE. IEEE, 1997, pp. 422--432. Google ScholarDigital Library
- Y.-K. Huang, S.-J. Liao, and C. Lee, "Efficient continuous k-nearest neighbor query processing over moving objects with uncertain speed and direction," in Proc. SSDBM, 2008, pp. 549--557. Google ScholarDigital Library
- G. Li, Y. Li, L. Shu, and P. Fan, "Cknn query processing over moving objects with uncertain speeds in road networks," in APWeb, 2011, pp. 65--76. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Züfle, "Indexing uncertain spatio-temporal data," in Proc. CIKM, 2012, pp. 395--404. Google ScholarDigital Library
- J. Niedermayer, A. Züfle, T. Emrich, M. Renz, N. Mamoulis, L. Chen, and H.-P. Kriegel, "Probabilistic nearest neighbor queries on uncertain moving object trajectories (technical report)," 2013, http://www.dbs.ifi.lmu.de/Publikationen/Papers/TRPNN.pdf.Google Scholar
- R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. VLDB, 1994, pp. 487--499. Google ScholarDigital Library
- R. Jampani, F. Xu, M. Wu, L. L. Perez, C. M. Jermaine, and P. J. Haas, "Mcdb: a monte carlo approach to managing uncertain data," in Proc. SIGMOD, 2008, pp. 687--700. Google ScholarDigital Library
- W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, pp. 13--30, 1963.Google ScholarCross Ref
- L. R. Welch, "Hidden markov models and the baum-welch algorithm," IEEE Information Theory Society Newsletter, vol. 53, no. 4, pp. 1, 10--13, 2003.Google Scholar
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An efficient and robust access method for points and rectangles," in Proc. SIGMOD, 1990. Google ScholarDigital Library
- J. Yuan, Y. Zheng, X. Xie, and G. Sun, "Driving with knowledge from the physical world," in Proc. KDD, 2011, pp. 316--324. Google ScholarDigital Library
Recommendations
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous work have studied many query types such as nearest neighbor query, range ...
Algorithms for constrained k-nearest neighbor queries over moving object trajectories
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest ...
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
Uncertain data are inherent in various important applications and reverse nearest neighbor (RNN) query is an important query type for many applications. While many different types of queries have been studied on uncertain data, there is no previous work ...
Comments