Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Efficient OLAP Operations in Spatial Data Warehouses
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
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Querying trajectories using flexible patterns
Proceedings of the 13th International Conference on Extending Database Technology
Searching trajectories by locations: an efficiency study
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient processing of top-k spatial keyword queries
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Retrieving k-nearest neighboring trajectories by a set of point locations
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
User oriented trajectory search for trip recommendation
Proceedings of the 15th International Conference on Extending Database Technology
Hi-index | 0.00 |
In this paper we present a new ranking measure for Top-k Trajectory query. A trajectory is defined as a sequence of places with each place having an associated text description with them. A top-k trajectory query consists of a set of locations and a set of activities, and returns a set of relevant trajectories to a user. A trajectory is considered more relevant if it has query activities at places nearby to the query locations. The proposed ranking measure helps to select highly relevant trajectories by capturing the correlation between trajectory places and activities while computing a trajectory relevance score. Previous works on Top-k trajectory query computed a trajectory relevance score either on the basis of spatial proximity or on the basis of combination of spatial proximity and textual similarity in some user defined proportion. These works did not consider association of spatial and textual dimensions, and hence may return trajectories that have query activities at trajectory places very far away from the query locations. In addition to the proposal of a ranking metric, we also give an algorithm to implement the proposed metric efficiently. Finally, we do an experimental study on a real dataset to demonstrate that the proposed ranking measure is indeed effective in terms of retrieval of trajectories that have query activities at places near to the query locations.