Código QR (código de barras bidimensional)

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...

Fuld beskrivelse

Na minha lista:
Principais autores: WAN Jing, TANG Bei-bei, HE Yun-bin, Li Song
Format: Artigo
Sprog:Chinês
Udgivet: Harbin University of Science and Technology Publications 2018-06-01
Serier:Journal of Harbin University of Science and Technology
Fag:
r-tree
knearest neighbor query
uncertainty
visibility
obstructed distance
Online adgang:https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1530
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker