Efficiently Monitoring Nearest Neighbors to a Moving Object 1st Edition by Cheqing Jin, Weibin Guo- Ebook PDF Instant Download/Delivery. 9783540738701
Full download Efficiently Monitoring Nearest Neighbors to a Moving Object 1st Edition after payment
Product details:
ISBN 13: 9783540738701
Author: Cheqing Jin; Weibin Guo
Continuous monitoring k nearest neighbors in highly dynamic scenarios appears to be a hot topic in database research community. Most previous work focus on devising approaches with a goal to consume litter computation resource and memory resource. Only a few literatures aim at reducing communication overhead, however, still with an assumption that the query object is static. This paper constitutes an attempt on continuous monitoring k nearest neighbors to a dynamic query object with a goal to reduce communication overhead. In our RFA approach, a Range Filter is installed in each moving object to filter parts of data (e.g. location). Furthermore, RFA approach is capable of answering three kinds of queries, including precise kNN query, non-value-based approximate kNN query, and value-based approximate kNN query. Extensive experimental results show that our new approach achieves significant saving in communication overhead
People also search for Efficiently Monitoring Nearest Neighbors to a Moving Object 1st:
efficient nearest neighbor search
jmp k nearest neighbors
network monitoring thresholds best practices
effective network monitoring system