PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data model and data structures for moving objects databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The implementation and performance of compressed databases
ACM SIGMOD Record
Query optimization in compressed database systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Wavelet synopses with error guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
The Geometry of Uncertainty in Moving Objects Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Approximate Query Processing Using Wavelets
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Incremental Maintenance of Approximate Histograms
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
A Spatiotemporal Model and Language for Moving Objects on Road Networks
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Mission-critical management of mobile sensors: or, how to guide a flock of sensors
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
On Multidimensional Wavelet Synopses for Maximum Error Bounds
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Compressing spatio-temporal trajectories
Computational Geometry: Theory and Applications
On the effect of trajectory compression in spatiotemporal querying
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Compressing spatio-temporal trajectories
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
Nonmaterialized motion information in transport networks
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
A common way of storing spatio-temporalinformation 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 uses a distance function in producing the trajectory approximation. We postulate the desiderata for such a distance: it should be sound, namely the error of the answers to spatio-temporal queries must be bounded. We analyze several distances, and prove that some are sound in this sense for some types of queries, while others are not. Interestingly, not a single distance analyzed proves to be sound for all the common spatio-temporal queries, and therefore multi-distance line-simplification is introduced and analyzed. Then we propose an aging mechanism which gradually shrinks the size of the trajectories as time progresses. Finally, we analyze experimentally the effectiveness of line-simplification in reducing the size of a trajectories database.