SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Clustering spatial data using random walks
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Proceedings of the 2004 ACM symposium on Applied computing
Discovering spatial patterns accurately with effective noise removal
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
Time relaxed spatiotemporal trajectory joins
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Closest-Point-of-Approach Join for Moving Object Histories
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
Computing longest duration flocks in trajectory data
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Information Sciences: an International Journal
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Multidimensional reverse kNN search
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient k-nearest-neighbor search algorthims for historical moving object trajectories
Journal of Computer Science and Technology
Continuous K-nearest neighbor queries for continuously moving points with updates
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A scalable constraint-based Q-hash indexing for moving objects
Information Sciences: an International Journal
Processing Mutual Nearest Neighbor Queries for Moving Object Trajectories
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Modeling and querying fuzzy spatiotemporal databases
Information Sciences: an International Journal
Discovery of convoys in trajectory databases
Proceedings of the VLDB Endowment
TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering
Proceedings of the VLDB Endowment
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Mining frequent trajectory patterns in spatial-temporal databases
Information Sciences: an International Journal
On efficient mutual nearest neighbor query processing in spatial databases
Data & Knowledge Engineering
Trajectory Outlier Detection: A Partition-and-Detect Framework
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient algorithms for historical continuous kNN query processing over moving object trajectories
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Ranking outliers using symmetric neighborhood relationship
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.)
IEEE Transactions on Information Theory
Inferring additional knowledge from QTCN relations
Information Sciences: an International Journal
Noisy data elimination using mutual k-nearest neighbor for classification mining
Journal of Systems and Software
K Nearest Neighbor Equality: Giving equal chance to all existing classes
Information Sciences: an International Journal
Searching continuous nearest neighbors in road networks on the air
Information Systems
| Hi-index | 0.07 |
Given a set D of trajectories, a query object q, and a query time extent @C, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k"1 nearest neighbors (NNs) of q within @C, and meanwhile, have q as one of their k"2 NNs. This type of queries is useful in many applications such as decision making, data mining, and pattern recognition, as it considers both the proximity of the trajectories to q and the proximity of q to the trajectories. In this paper, we first formalize MNN search and identify its characteristics, and then develop several algorithms for processing MNN queries efficiently. In particular, we investigate two classes of MNN queries, i.e., MNN"P and MNN"T queries, which are defined with respect to stationary query points and moving query trajectories, respectively. Our methods utilize the batch processing and reusing technology to reduce the I/O cost (i.e., number of node/page accesses) and CPU time significantly. In addition, we extend our techniques to tackle historical continuous MNN (HCMNN) search for moving object trajectories, which returns the mutual nearest neighbors of q (for a specified k"1 and k"2) at any time instance of @C. Extensive experiments with real and synthetic datasets demonstrate the performance of our proposed algorithms in terms of efficiency and scalability.