Deterministic minimal time vessel routing
Operations Research
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Visible Reverse k-Nearest Neighbor Queries
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Moving K-Nearest Neighbor Query over Obstructed Regions
APWEB '10 Proceedings of the 2010 12th International Asia-Pacific Web Conference
| Hi-index | 0.00 |
As the fundamental application of Location Based Service (LBS), k nearest neighbors query has received dramatic attention. In this paper, for the first time, we study how to monitor the weighted k nearest neighbors(WkNN) in a novel weighted space to reflect more complex scenario. Different from traditional kNN approaches, the distances are measured according to a weighted Euclidean metric. The length of a path is defined to be the sum of its weighted subpaths, where a weighted subpath is relative to the weights of its passing regions. By dividing the plane into a set of Combination Regions, a data structure "Weighted Indexing Map"(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called wNeighbors, for answering the WkNN query. The experimental results show that our WIM based WkNN processing algorithm are effective and efficient.