| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 100 === In recent years, the technology of wireless network and GPS were developed rapidly, that extends many kinds of applications and services based on user’s location. Spatial query, one of these applications, is a major spatial-based query with help of GPS technology.
Continuous Reverse k nearest neighbor query (CRkNN query) is a new issue in spatial query. In CRkNN problem, the querier wants to know that itself is included in who’s k nearest neighbors during the query time. Consider every object can move freely, the query results may continuously change in each time unit. Thus, how to make querier can always get the correct result becomes a challenge.
On the other hand, due to the constraints of the bandwidth of server and the electric power of mobile nodes, we propose a solution combining the advantages of the existing method. Finally, we show that our solution can reduce a lot of communication cost and performs more efficiently.
|
|---|
