Reverse Furthest Neighbors in Spatial Databases空间数据库中的反向最近邻.pptVIP

Updating Convex Hull Deleting points: Points or MBRs with the largest perpendicular distance to plpr are added into CP first, until there is no points outside the current convex hull. External Convex Hull Computing Existing algorithms can found 2-Dimensional convex hulls with I/Os. However, when convex hulls are still too large to fit into memory, we use Dudley’s approximate convex hull. CPU time number of IOs Thank You! Questions? * * Bin Yao, Feifei Li, Piyush Kumar Presenter: Lian Liu Introduction Related Work Algorithms PFC (Progressive Furthest Cell) CHFC (Convex Hull Furthest Cell) Experiment Discussion Assume you live at p1 (p2, p3), where would you prefer to build a chemical factory among q1~q3? Let P={p1, p2, p3} Q={q1, q2, q3} fn(p1, Q)=q3 fn(p2, Q)=q1 fn(p3, Q)=q1 BRFN(q1,Q,P)={p2, p3} BRFN(q2,Q,P)={} BRFN(q3,Q,P)={p1} Build the chemical factory here Problem: Given query point q, data set P (and Q), Compute MRFN(q, P) and BRFN(q, Q, P). MBR MBR (Minimum Bounding Rectangles) has 3 important distances to a point: Min Distance Max Distance Minmax Distance R-tree R-tree is an index data structure. In R-trees, points are grouped into MBRs, which are recursively grouped into MBRs in higher levels of the tree. Range query Range query: retrieves all points that locates within the query window. R-tree based algorithms proves to be efficient to deal with range queries. How to compute the MRFN of a given query point? BFS (Brute-Force Search) PFC (Progressive Furthest Cell) Main Idea: Find the cell (region) in which all reverse furthest neighbors of the query point located Perform a range query with the cell How to compute? FVC (Furthest Voronoi Cell) FVC Example: query point = q1 fvc(q1, P) fvc(q1, P) PFC (Progressive Furthest Cell) Algorithm Points and MBRs are stored in a priority queue L with their minmaxdist sorted in decreasing order. Two vectors Vc and Vp are also maintained: Vc: Furthest neighbor candid