Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. White, Dave Bernstein, A. Kornhauser (2000)
Some map matching algorithms for personal navigation assistantsTransportation Research Part C-emerging Technologies, 8
J. Hobby (1993)
Polygonal approximations that minimize the number of inflections
(1998)
Special issue on data reduction techniques
V. Hardle, G. Kerkyacharian, D. Picard, A. Tsybakov (1998)
Wavelets, Approximation, and Statistical Applications
Zhiming Ding, R. Güting (2004)
Uncertainty Management for Network Constrained Moving Objects
(2000)
Map Projection Transformations: Principles and Applications
D. Arctur, M. Zeiler (2004)
Designing Geodatabases: Case Studies in GIS Data Modeling
Goce Trajcevski, O. Wolfson, Fengli Zhang, S. Chamberlain (2002)
The Geometry of Uncertainty in Moving Objects Databases
Jeffrey Hightower, G. Borriello (2001)
Location Systems for Ubiquitous ComputingComputer, 34
H. Imai, M. Iri (1988)
Polygonal Approximations of a Curve — Formulations and AlgorithmsMachine Intelligence and Pattern Recognition, 6
T. Sellis, Manolis Koubarakis, A. Frank, S. Grumbach, R. Güting, Christian Jensen, N. Lorentzos, Y. Manolopoulos, E. Nardelli, B. Pernici, H. Schek, M. Scholl, B. Theodoulidis, N. Tryfona (2003)
Spatio-Temporal Databases: The CHOROCHRONOS Approach
J. Hershberger, J. Snoeyink (1992)
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
Zhiyuan Chen, J. Gehrke, Flip Korn (2001)
Query optimization in compressed database systems
P. Agarwal, L. Arge, Jeff Erickson (2000)
Indexing moving points (extended abstract)
(1973)
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
O. Wolfson (2002)
Moving Objects Information Management: The Database Challenge
M. Vazirgiannis, O. Wolfson (2001)
A Spatiotemporal Model and Language for Moving Objects on Road Networks
J. Greenfeld (2002)
MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP
Zhiming Ding, R. Güting (2004)
Managing moving objects on dynamic transportation networksProceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.
D. Pfoser, Christian Jensen, Y. Theodoridis (2000)
Novel Approaches in Query Processing for Moving Object Trajectories
Wai-Sum Chan, F. Chin (1996)
Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum errorInt. J. Comput. Geom. Appl., 6
P. Samarati, L. Sweeney (1998)
Generalizing data to provide anonymity when disclosing information (abstract)
J. Lema, L. Forlizzi, R. Güting, E. Nardelli, Markus Schneider (2003)
Algorithms for Moving Objects DatabasesComput. J., 46
J. Veijalainen, E. Ojanen, M.A. Haq, V.-P. Vahteala, M. Matsumoto (2004)
Energy consumption tradeoffs for compressed wireless data at a mobile terminalIEICE Trans., Spec. Issu. Multimedia Commun., E87-B
P. Agarwal, Kasturi Varadarajan (2000)
Efficient Algorithms for Approximating Polygonal ChainsDiscrete & Computational Geometry, 23
J. Veijalainen, Eetu Ojanen, Mohammad Haq, Ville Vahteala, M. Matsumoto (2004)
Energy consumption tradeoffs for compressed wireless data at a mobile terminalIEICE Transactions on Communications, 87
P. Agarwal, L. Arge, Jeff Erickson (2003)
Indexing Moving PointsJ. Comput. Syst. Sci., 66
R. Weibel (1996)
Generalization of Spatial Data: Principles and Selected Algorithms
K. Chakrabarti, M. Garofalakis, R. Rastogi, Kyuseok Shim (2001)
Approximate query processing using waveletsThe VLDB Journal, 10
M. Garofalakis, Phillip Gibbons (2002)
Wavelet synopses with error guarantees
(2004)
editors
J. Schiller, A. Voisard (2004)
Location Based Services
Phillip Gibbons, Yossi Matias, V. Poosala (1997)
Fast incremental maintenance of approximate histograms
R. McMaster (1987)
Automated Line GeneralizationCartographica: The International Journal for Geographic Information and Geovisualization, 24
T. Westmann, Donald Kossmann, S. Helmer, G. Moerkotte (2000)
The implementation and performance of compressed databasesSIGMOD Rec., 29
C. Hage, Christian Jensen, T. Pedersen, Laurynas Speicys, Igor Timko (2003)
Integrated Data Management for Mobile Services in the Real World
L. Forlizzi, R. Güting, E. Nardelli, Markus Schneider (2000)
A data model and data structures for moving objects databases
M. Vlachos, D. Gunopulos, G. Kollios (2002)
Discovering similar multidimensional trajectoriesProceedings 18th International Conference on Data Engineering
E. Pitoura, G. Samaras (2001)
Locating Objects in Mobile ComputingIEEE Trans. Knowl. Data Eng., 13
G. Kollios, D. Gunopulos, V. Tsotras (1999)
On indexing mobile objects
R. Veltkamp (1998)
Hierarchical approximation and localizationThe Visual Computer, 14
Goce Trajcevski, O. Wolfson, K. Hinrichs, S. Chamberlain (2004)
Managing uncertainty in moving objects databasesACM Trans. Database Syst., 29
D. Pfoser, Christian Jensen (1999)
Capturing the Uncertainty of Moving-Object Representations
R. Güting, Michael Böhlen, Martin Erwig, Christian Jensen, N. Lorentzos, E. Nardelli, Markus Schneider, J. Viqueira (2003)
Spatio-temporal Models and Languages: An Approach Based on Data Types
G. Graefe, L. Shapiro (1991)
Data compression and database performance[Proceedings] 1991 Symposium on Applied Computing
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal Digital Assistants become location-aware, the size of the spatio-temporal information generated may prohibit efficient processing. We propose to adopt a technique studied in computer graphics, namely line-simplification, as an approximation technique to solve this problem. Line simplification will reduce the size of the trajectories. Line simplification uses a distance function in producing the trajectory approximation. We postulate the desiderata for such a distance-function: it should be sound, namely the error of the answers to spatio-temporal queries must be bounded. We analyze several distance functions, and prove that some are sound in this sense for some types of queries, while others are not. A distance function that is sound for all common spatio-temporal query types is introduced and analyzed. Then we propose an aging mechanism which gradually shrinks the size of the trajectories as time progresses. We also propose to adopt existing linguistic constructs to manage the uncertainty introduced by the trajectory approximation. Finally, we analyze experimentally the effectiveness of line-simplification in reducing the size of a trajectories database.
The VLDB Journal – Springer Journals
Published: Sep 1, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.