Abstract
The traditional way of representing motion in 3D space-time uses a trajectory, i.e. a sequence of (x,y,t) points. Such a trajectory may be produced by periodic sampling of a Global Positioning System (GPS) receiver. The are two problems with this representation of motion. First, imprecision due to errors (e.g. GPS receivers often produce off-the-road locations), and second, space complexity due to a large number of samplings. We examine an alternative representation, called a nonmaterialized trajectory, which addresses both problems by taking advantage of the a priori knowledge that the motion occurs on a transport network.
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.
Similar content being viewed by others
References
Special issue on data reduction techniques. IEEE Data Engineering 20(4) (1998)
Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation A survey. Technical Report B 96-11, Institut für Informatik, Freie Universität Berlin (1996)
Cao, H., Wolfson, O., Trajcevski, G.: Spatiotemporal data reduction with deterministic error bounds. In: DIALM-POMC 2003, pp. 33–42 (2003)
Chakrabarti, K., Garofalakis, M., Rastogi, R., Shim, K.: Approximate query processing using wavelets. In: VLDB 2000 (Septermber 2000)
Chen, C., Thakkar, S., Knoblock, C., Shahabi, C.: Automatically annotating and integrating spatial datasets. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750. Springer, Heidelberg (2003)
Chen, Z., Gehrke, J., Korn, F.: Query optimization in compressed database systems. In: ACM SIGMOD 2001, pp. 271–282. ACM Press, New York (2001)
Florizzi, L., Guting, R.H., Nardelli, E., Schneider, M.: A data model and data structures for moving objects databases. Technical Report 260-10, Fern-Universität Hagen (1999)
Frentzos, E.: Indexing objects moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750. Springer, Heidelberg (2003)
Ghosh, S.K.: Computing the visibility polygon from a convex set and related problem. Journal of Algorithms 12, 75–95 (1991)
Gibbons, P.B., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. In: VLDB (1997)
Greenfeld, J.S.: Matching gps observations to locations on a digital map. In: The 81th Annual Meeting of the Transportation Research Board, Washington D.C. (2002)
Guibas, L.J., Hershberger, J.E., Mitchell, J.S.B., Snoeyink, J.S.: Approximating polygons and subdivisions with minimum link paths. In: ISAAC 1991 (1991)
Meratnia, N., de By, R.A.: Spatiotemporal compression techniques for moving point objects. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 765–782. Springer, Heidelberg (2004)
Pfoser, D., Jensen, C.S.: Indexing of network constrained moving objects. In: ACM GIS, pp. 25–32. ACM Press, New York (2003)
Thrun, S.: Robotic mapping: a survey. In: Exploring artificial intelligence in the new millennium, pp. 1–35. Morgan Kaufmann Publishers Inc., San Francisco (2003)
White, C.E., Bernstein, D., Kornhauser, A.L.: Some map matching algorithms for personal navigation assistants. Transportation Research Part C 8, 91–108 (2000)
Yin, H., Wolfson, O.: A weight-based map matching method in moving objects databases. In: SSTDM (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, H., Wolfson, O. (2004). Nonmaterialized Motion Information in Transport Networks. In: Eiter, T., Libkin, L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30570-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30570-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24288-8
Online ISBN: 978-3-540-30570-5
eBook Packages: Computer ScienceComputer Science (R0)