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...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Chinês |
| Publicado em: |
Harbin University of Science and Technology Publications
2018-06-01
|
| coleção: | Journal of Harbin University of Science and Technology |
| Assuntos: | |
| Acesso em linha: | https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1530 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|