Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Nearest and reverse nearest neighbor queries for moving objects
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
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
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
CkNN query processing over moving objects with uncertain speeds in road networks
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Probabilistic time consistent queries over moving objects
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Efficient identification and approximation of k-nearest moving neighbors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Continuous K-nearest neighbor (CKNN) query is one of the most fundamental queries in the field of spatio-temporal databases. Given a time interval [t"s,t"e], a CKNN query is to retrieve the K-nearest neighbors (KNNs) of a moving user at each time instant within [t"s,t"e]. Existing methods for processing a CKNN query, however, assume that each object moves with a fixed direction and/or a fixed speed. In this paper, we relieve this assumption by allowing both the moving speed and the moving direction of each object to vary. This uncertainty on speed and direction of a moving object would increase the complexity of processing a CKNN query. We thoroughly analyze the involved issues incurred by this uncertainty and propose a continuous possible KNN (CPKNN) algorithm to effectively find the objects that could be the KNNs. These objects are termed the possible KNNs (PKNNs) in this paper. A probability-based model is designed accordingly to quantify the possibility of each PKNN being the KNN. In addition, we design a PKNN updating mechanism to rapidly evaluate the new query result when object updates occur. Comprehensive experiments are conducted to demonstrate the effectiveness and the efficiency of the proposed approach.