Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An efficient and accurate method for evaluating time series similarity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Learning travel recommendations from user-generated GPS traces
ACM Transactions on Intelligent Systems and Technology (TIST)
Recommending friends and locations based on individual location history
ACM Transactions on the Web (TWEB)
Voronoi-based range query for trajectory data in spatial networks
Proceedings of the 2011 ACM Symposium on Applied Computing
STS: complex spatio-temporal sequence mining in flickr
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
The detection of scene features in Flickr
ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
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
Unveiling the complexity of human mobility by querying and mining massive trajectory data
The VLDB Journal — The International Journal on Very Large Data Bases
Discovering personalized routes from trajectories
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
On mining anomalous patterns in road traffic streams
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
User oriented trajectory search for trip recommendation
Proceedings of the 15th International Conference on Extending Database Technology
On the spatiotemporal burstiness of terms
Proceedings of the VLDB Endowment
Constructing popular routes from uncertain trajectories
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Exploiting large-scale check-in data to recommend time-sensitive routes
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
User oriented trajectory similarity search
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
Exploration of ground truth from raw GPS data
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
A generic data model for moving objects
Geoinformatica
Exploring pattern-aware travel routes for trajectory search
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
Modeling and probabilistic reasoning of population evacuation during large-scale disaster
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Constructing trip routes with user preference from location check-in data
Proceedings of the 2013 ACM conference on Pervasive and ubiquitous computing adjunct publication
An effectiveness study on trajectory similarity measures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Group trip planning queries in spatial databases
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
A ranking measure for top-k moving object trajectories search
Proceedings of the 7th Workshop on Geographic Information Retrieval
Data centric research at the University of Queensland
ACM SIGMOD Record
Customized tour recommendations in urban areas
Proceedings of the 7th ACM international conference on Web search and data mining
Hi-index | 0.00 |
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new problem of searching trajectories by locations, in which context the query is only a small set of locations with or without an order specified, while the target is to find the k Best-Connected Trajectories (k-BCT) from a database such that the k-BCT best connect the designated locations geographically. Different from the conventional trajectory search that looks for similar trajectories w.r.t. shape or other criteria by using a sample query trajectory, we focus on the goodness of connection provided by a trajectory to the specified query locations. This new query can benefit users in many novel applications such as trip planning. In our work, we firstly define a new similarity function for measuring how well a trajectory connects the query locations, with both spatial distance and order constraint being considered. Upon the observation that the number of query locations is normally small (e.g. 10 or less) since it is impractical for a user to input too many locations, we analyze the feasibility of using a general-purpose spatial index to achieve efficient k-BCT search, based on a simple Incremental k-NN based Algorithm (IKNN). The IKNN effectively prunes and refines trajectories by using the devised lower bound and upper bound of similarity. Our contributions mainly lie in adapting the best-first and depth-first k-NN algorithms to the basic IKNN properly, and more importantly ensuring the efficiency in both search effort and memory usage. An in-depth study on the adaption and its efficiency is provided. Further optimization is also presented to accelerate the IKNN algorithm. Finally, we verify the efficiency of the algorithm by extensive experiments.