SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On the approximation of curves by line segments using dynamic programming
Communications of the ACM
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On nearest neighbor indexing of nonlinear trajectories
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Processing in-route nearest neighbor queries: a comparison of alternative approaches
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Spatio-Temporal Aggregation Using Sketches
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Algorithm Design
In-Route Nearest Neighbor Queries
Geoinformatica
Foundations of probabilistic answers to queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Spatio-temporal data reduction with deterministic error bounds
The VLDB Journal — The International Journal on Very Large Data Bases
Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Range search on multidimensional uncertain data
ACM Transactions on Database Systems (TODS)
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A Hybrid Prediction Model for Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Remote real-time trajectory simplification
PERCOM '09 Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications
MOIR/MT: monitoring large-scale road network traffic in real-time
Proceedings of the VLDB Endowment
Algorithms for compressing GPS trajectory data: an empirical evaluation
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Probabilistic range queries for uncertain trajectories on road networks
Proceedings of the 14th International Conference on Extending Database Technology
An effectiveness study on trajectory similarity measures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
| Hi-index | 0.00 |
Trajectory compression is widely used in spatial-temporal databases as it can notably reduce (i) the computation/communication load of clients (GPS-enabled mobile devices) and (ii) the storage cost of servers. Compared with original trajectories, compressed trajectories have clear advantages in data processing, transmitting, storing, etc. In this paper, we investigate a novel problem of searching the Path Nearest Neighbor based on Compressed Trajectories (PNN-CT query). This type of query is conducted on compressed trajectories and the target is to retrieve the PNN with the highest probability (lossy compression leads to the uncertainty), which can bring significant benefits to users in many popular applications such as trip planning. To answer the PNN-CT query effectively and efficiently, a two-phase solution is proposed. First, we use the meta-data and sample points to specify a tight search range. The key of this phase is that the number of data objects/trajectory segments to be processed or decompressed should be kept as small as possible. Our efficiency study reveals that the candidate sets created are tight. Second, we propose a reconstruction algorithm based on probabilistic models to account for the uncertainty when decompressing the trajectory segments in the candidate set. Furthermore, an effective combination strategy is adopted to find the PNN with the highest probability. The complexity analysis shows that our solution has strong advantages over existing methods. The efficiency of the proposed PNN-CT query processing is verified by extensive experiments based on real and synthetic trajectory data in road networks.