Abstract
Density queries are defined as querying the dense regions that include more than a certain number of moving objects. Previous research studies mainly focus on how to answer the snap-shot density queries over historical trajectories. However, the real applications usually tend to predict whether a region is a dense region. Especially in indoor environments, such predictive density queries are valuable for high-level analysis but face tremendous challenges. In this paper, by leveraging the Markov correlations, we effectively predict the future locations of moving objects and conduct the density queries accordingly. In particular, we present an optimized framework which contains three phases to tackle this problem. First, we design an index structure based on the transition matrix to facilitate the search process. Second, we propose the space and probability pruning techniques to improve the query efficiency significantly. Finally, we apply an accurate method and an approximate sampling method to verify whether each unpruned region is a dense region. Extensive experiments on real datasets demonstrate that the proposed solutions can outperform the baseline algorithm by up to \(2\) orders of magnitudes in running time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Agrawal, D.: On nearest neighbor indexing of nonlinear trajectories. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003, pp. 252–259. ACM, New York (2003)
Emrich, T., Kriegel, H.-P., Mamoulis, N., Niedermayer, J., Renz, M., Züfle, A.: Reverse-nearest neighbor queries on uncertain moving object trajectories. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014, Part II. LNCS, vol. 8422, pp. 92–107. Springer, Heidelberg (2014)
Emrich, T., Kriegel, H.-P., Mamoulis, N., Renz, M., Züfle, A.: Querying uncertain spatio-temporal data. In: ICDE, pp. 354–365 (2012)
Hadjieleftheriou, M., Kollios, G., Gunopulos, D., Tsotras, V.J.: On-line discovery of dense areas in spatio-temporal databases. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 306–324. Springer, Heidelberg (2003)
Jensen, C.S., Lin, D., Ooi, B.C., Zhang, R.: Effective density queries on continuouslymoving objects. In: ICDE, p. 71 (2006)
Kolodziej, J., Khan, S.U., Wang, L., Min-Allah, N., Madani, S.A., Ghani, N., Li, H.: An application of markov jump process model for activity-based indoor mobility prediction in wireless networks. In: FIT 2011, pp. 51–56 (2011)
Letchner, J., Ré, C., Balazinska, M., Philipose, M.: Access methods for markovian streams. In: ICDE, pp. 246–257 (2009)
Lian, X., Chen, L.: A generic framework for handling uncertain data with local correlations. PVLDB 4(1), 12–21 (2010)
Ni, J., Ravishankar, C. V.: Pointwise-dense region queries in spatio-temporal databases. In: ICDE, pp. 1066–1075 (2007)
Niedermayer, J., Züfle, A., Emrich, T., Renz, M., Mamoulis, N., Chen, L., Kriegel, H.-P.: Probabilistic nearest neighbor queries on uncertain moving object trajectories (2013). arXiv preprint arXiv:1305.3407
Ré, C., Letchner, J., Balazinska, M., Suciu, D.: Event queries on correlated probabilistic streams. In: SIGMOD Conference, pp. 715–728 (2008)
Soliman, M.A., Ilyas, I.F., Ben-David, S.: Supporting ranking queries on uncertain and incomplete data. VLDB J. 19(4), 477–501 (2010)
Yang, B., Lu, H., Jensen, C.S.: Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 335–346. ACM (2010)
Yu, J., Ku, W.-S., Sun, M.-T., Lu, H.: An rfid and particle filter-based indoor spatial query evaluation system. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 263–274. ACM (2013)
Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: SSDBM, pp. 297–306 (2004)
Zhang, M., Chen, S., Jensen, C.S., Ooi, B.C., Zhang, Z.: Effectively indexing uncertain moving objects for predictive queries. PVLDB 2(1), 1198–1209 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, M., Gu, Y., Yu, G. (2015). Effective and Efficient Predictive Density Queries for Indoor Moving Objects. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9049. Springer, Cham. https://doi.org/10.1007/978-3-319-18120-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-18120-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18119-6
Online ISBN: 978-3-319-18120-2
eBook Packages: Computer ScienceComputer Science (R0)