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

תיאור מלא

שמור ב:
מידע ביבליוגרפי
Main Authors: WAN Jing, TANG Bei-bei, HE Yun-bin, Li Song
פורמט: Artigo
שפה:Chinês
יצא לאור: Harbin University of Science and Technology Publications 2018-06-01
סדרה:Journal of Harbin University of Science and Technology
נושאים:
r-tree
knearest neighbor query
uncertainty
visibility
obstructed distance
גישה מקוונת:https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1530
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים