ABSTRACT
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.
- Tang, L. A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: SSTD. (2011) 223--241 Google ScholarDigital Library
- Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: EDBT. (2012) 156--167 Google ScholarDigital Library
- Chakka, V., Everspaugh, A., Patel, J.: Indexing large trajectory data sets with seti. In: CIDR. (2003) 48109--2122Google Scholar
- Cudré-Mauroux, P., Wu, E., Madden, S.: Trajstore: An adaptive storage system for very large trajectory data sets. In: ICDE. (2010) 109--120Google Scholar
- Pfoser, D., Jensen, C. S., Theodoridis, Y.: Novel approaches in query processing for moving object trajectories. In: VLDB. (2000) 395--406 Google ScholarDigital Library
- Tao, Y., Papadias, D.: Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In: VLDB. (2001) 431--440 Google ScholarDigital Library
- Theodoridis, Y., Sellis, T. K., Papadopoulos, A., Manolopoulos, Y.: Specifications for efficient indexing in spatiotemporal databases. In: SSDBM. (1998) 123--132 Google ScholarDigital Library
- Chen, Z., Shen, H. T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: SIGMOD. (2010) 255--266 Google ScholarDigital Library
- Hadjieleftheriou, M., Kollios, G., Bakalov, P., Tsotras, V. J.: Complex spatio-temporal pattern queries. In: VLDB. (2005) 877--888 Google ScholarDigital Library
- Vieira, M. R., Bakalov, P., Tsotras, V. J.: Querying trajectories using flexible patterns. In: EDBT. (2010) 406--417 Google ScholarDigital Library
- Agrawal, R., Faloutsos, C., Swami, A. N.: Efficient similarity search in sequence databases. In: FODO. (1993) 69--84 Google ScholarDigital Library
- Chen, L., Özsu, M. T., Oria, V.: Robust and fast similarity search for moving object trajectories. In: SIGMOD. (2005) 491--502 Google ScholarDigital Library
- Lee, J. G., Han, J., Whang, K. Y.: Trajectory clustering: a partition-and-group framework. In: SIGMOD. (2007) 593--604 Google ScholarDigital Library
- Mamoulis, N., Cao, H., Kollios, G., Hadjieleftheriou, M., Tao, Y., Cheung, D. W.: Mining, indexing, and querying historical spatiotemporal data. In: KDD. (2004) 236--245 Google ScholarDigital Library
- Vlachos, M., Gunopoulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: ICDE. (2002) 673-- Google ScholarDigital Library
- De Felipe, I., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: ICDE. (2008) 656--665 Google ScholarDigital Library
- Zhang, D., Chee, Y. M., Mondal, A., Tung, A. K. H., Kitsuregawa, M.: Keyword search in spatial databases: Towards searching by document. In: ICDE. (2009) 688--699 Google ScholarDigital Library
- Cong, G., Jensen, C. S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. PVLDB 2(1) (August 2009) 337--348 Google ScholarDigital Library
- Rocha-Junior, J. a. B., Gkorgkas, O., Jonassen, S., Nørvåg, K.: Efficient processing of top-k spatial keyword queries. In: SSTD. (2011) 205--222 Google ScholarDigital Library
- Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient olap operations in spatial data warehouses. In: SSTD '01. (2001) 443--459 Google ScholarDigital Library
- Cao, X., Cong, G., Jensen, C. S., Ooi, B. C.: Collective spatial keyword querying. In: SIGMOD. (2011) 373--384 Google ScholarDigital Library
- Cong, G., Lu, H., Ooi, B. C., Zhang, D., Zhang, M.: Efficient spatial keyword search in trajectory databases. CoRR abs/1205.2880 (2012)Google Scholar
Index Terms
- A ranking measure for top-k moving object trajectories search
Recommendations
Popularity-aware spatial keyword search on activity trajectories
The proliferation of GPS-enabled smart mobile devices enables us to collect a large-scale trajectories of moving objects with GPS tags. While the raw trajectories that only consists of positional information have been studied extensively, many recent ...
Searching activity trajectory with keywords
Driven by the advances in location positioning techniques and the popularity of location sharing services, semantic enriched trajectory data has become unprecedentedly available. While finding relevant Point-of-Interests (PoIs) based on users' locations ...
Efficient Trajectory Cover Search for Moving Object Trajectories
MS '13: Proceedings of the 2013 IEEE Second International Conference on Mobile ServicesGiven a set of query locations and a set of query keywords, a Trajectory Cover (CT) query over a repository of mobile trajectories returns a minimal set of trajectories that maximally covers the query keywords and are also spatially close to the query ...
Comments