A Continuous k-Nearest Neighbor Query Method for Moving Data in Obstructed Spaces
For the nearest neighbor query problem of continuous moving objects in spatio-temporal databases, the COpKNN (continuous obstructed possible k-nearest neighbor) query is proposed: in a two-dimensional space, given a moving query point q, a set of moving query object sets P and a set of polygonal obs...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Harbin University of Science and Technology Publications
2018-06-01
|
| Series: | Journal of Harbin University of Science and Technology |
| Subjects: | |
| Online Access: | https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1530 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|