Abstract
We are witnessing a tremendous increase in internet connected, geo-positioned mobile devices, e.g., smartphones and personal navigation devices. Therefore, location related services are becoming more and more important. This results in a very high load on both communication networks and server-side infrastructure. To avoid an overload we point out the beneficial effects of exploiting future routes for the early generation of the expected results of spatio-temporal queries. Probability density functions are employed to model the uncertain movement of objects. This kind of probable results is important for operative analytics in many applications like smart fleet management or intelligent logistics. An index structure is presented which allows for a fast maintenance of query results under continuous changes of mobile objects. We present a cost model to derive initialization parameters of the index and show that extensive parallelization is possible. A set of experiments based on realistic data shows the efficiency of our approach.
This is a preview of subscription content, log in via an institution to check access.
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
Patroumpas, K., Sellis, T.K.: Managing trajectories of moving objects as data streams. In: STDBM 2004, pp. 41–48 (2004)
Schmiegelt, P., Seeger, B.: Querying the future of spatio-temporal objects. In: ACM GIS 2010, pp. 486–489 (2010)
Schmiegelt, P., Seeger, B., Behrend, A., Koch, W.: Continuous queries on trajectories of moving objects. In: IDEAS 2012, pp. 165–174 (2012)
Krämer, J., Seeger, B.: Semantics and implementation of continuous sliding window queries over data streams. TODS 34(1), 1–49 (2009)
Lin, D., Cui, B., Yang, D.: Optimizing moving queries over moving object data streams. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 563–575. Springer, Heidelberg (2007)
Koch, W.: On bayesian tracking and data fusion: A tutorial introduction with examples. IEEE AESS Magazine 25(7), 29–52
Samet, H.: The Design and Analysis of Spatial Data Structures (Addison-Wesley). Addison-Wesley Pub. (Sd)
Brinkhoff, T., Str, O.: A framework for generating network-based moving objects. Geoinformatica 6 (2002)
DeWitt, D., Gray, J.: Parallel database systems: the future of high performance database systems. Commun. ACM 35, 85–98 (1992)
Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: An efficient index for predicted trajectories. In: SIGMOD 2004, pp. 637–646 (2004)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient b + -tree based indexing of moving objects. In: VLDB 2004, pp. 768–779 (2004)
Nehme, R.V., Rundensteiner, E.A.: Scuba: Scalable cluster-based algorithm for evaluating continuous spatio-temporal queries on moving objects. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 1001–1019. Springer, Heidelberg (2006)
Mokbel, M.F., Xiong, X., Hammad, M.A., Aref, W.G.: Continuous query processing of spatio-temporal data streams in place. Geoinformatica 9(4), 343–365 (2005)
Mokbel, M.F., Xiong, X., Aref, W.G.: Sina: Scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD 2004, pp. 623–634 (2004)
Tao, Y., Papadias, D., Sun, J.: The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In: VLDB 2003, pp. 790–801 (2003)
Trajcevski, D., et al.: Managing uncertainty in moving objects databases. TODS 29(3), 463–507 (2004)
Ding, H., Trajcevski, G., Scheuermann, P.: Efficient maintenance of continuous queries for trajectories. Geoinformatica 12(3), 255–288 (2008)
Chon, H.D., Agrawal, D., El Abbadi, A.: Range and knn query processing for moving objects in grid model. Mob. Netw. Appl. 8(4), 401–412 (2003)
Hadjieleftheriou, M., Kollios, G., Tsotras, J., Gunopulos, D.: Indexing spatiotemporal archives. The VLDB Journal 15(2), 143–164 (2006)
De Almeida, V.T., Güting, R.H.: Indexing the trajectories of moving objects in networks. Geoinformatica 9(1), 33–60 (2005)
Dittrich, J., Blunschi, L., Vaz Salles, M.A.: Indexing moving objects using short-lived throwaway indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 189–207. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmiegelt, P., Behrend, A., Seeger, B., Koch, W. (2013). A Probabilistic Index Structure for Querying Future Positions of Moving Objects. In: Catania, B., Guerrini, G., Pokorný, J. (eds) Advances in Databases and Information Systems. ADBIS 2013. Lecture Notes in Computer Science, vol 8133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40683-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-40683-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40682-9
Online ISBN: 978-3-642-40683-6
eBook Packages: Computer ScienceComputer Science (R0)