Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Speed and Uncertain Direction
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 95 === One of the most important queries in spatio-temporal databases that aims at managing moving objects efficiently is the continuous K-Nearest Neighbor (CKNN) query. Given a future time interval [ts, te] and a moving query object q, a CKNN query is to retrieve th...
Main Authors: | Shi-Jei Liao, 廖世傑 |
---|---|
Other Authors: | Chiang-Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72913110880310781446 |
Similar Items
-
Continuous Visible k Nearest Neighbor queries on Moving Objects with View Field constraint
by: Ding-LiChen, et al.
Published: (2017) -
Efficient Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks
by: Chih-wei Chen, et al.
Published: (2009) -
A Study on Continuous Reverse k Nearest-Neighbor Queries over Moving Objects
by: Hui-ling Huang, et al.
Published: (2012) -
Enhancing querying performance for nearest neighbors on uncertain data using US+-Trees
by: Fan-Ya Kao, et al.
Published: (2011) -
Exploring Probabilistic Reverse Nearest Neighbors Query over Uncertain Data Streams
by: Lin-Ru Feng, et al.