data management+ laboratory v*-knn: an efficient algorithm for moving k nearest neighbor queries...
TRANSCRIPT
![Page 1: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/1.jpg)
Data Management+ Laboratory
V*-kNN: an Efficient Algorithm forMoving k Nearest Neighbor Queries
Speaker: AdamAdviser: Yuling Hsueh
2009 IEEE International Conference on Data Engineering
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik
![Page 2: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/2.jpg)
INTRODUCTION
What is “Moving k Nearest Neighbor Queries(MkNN)” ?- K Nearest Neighbor Query(kNN)
- Example of MkNN: Ambulance
Purpose: reduce the computation costs
DM+ Page 2
![Page 3: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/3.jpg)
INTRODUCTION
To avoid unnecessary data access(computation): Safe region
Safe region: a region in which the query point can move without changing the result
This V*-kNN is based on two types of safe regions, the fixed-rank region (FRR) and the safe region with regard to a data point
DM+ Page 3
![Page 4: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/4.jpg)
INTRODUCTION
Using a safe region-based method, an MkNN query can be processed :
(i) finding the current k NNs
(ii) calculating a region that the current k NNs are valid, i.e., a safe-region of the kNN;
(iii) repeating the first two steps when the query point moves out of the safe region.
DM+ Page 4
![Page 5: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/5.jpg)
Fixed-Rank Region
Compute regions (F(p1,p2,…,pn) or F(L)) where the ranking of all the objects (based on their distances) is the same
Need: list of points and corresponding list of bisectors
List of points: sorted in ascending order by their distances to the query point
Corresponding list of bisectors: for n points, it requires at most (n-1) bisectors of the (n-1) pairs of rank-adjacent points
DM+ Page 5
![Page 6: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/6.jpg)
Fixed-Rank Region
DM+ Page 6
Each time the query point crosses a bisector, the ranks of the two corresponding points are swapped and the list of rank-adjacent bisectors are updated.
Only rank-adjacent points can swap their ranks
![Page 7: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/7.jpg)
Fixed-Rank Region
DM+ Page 7
(a, c, b, f, e, d) , ( Bac, Bbc, Bbf , Bef , Bde )
(a, c, b, e, f, d) , ( Bac, Bbc, Bbe , Bef , Bfd )
![Page 8: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/8.jpg)
Safe Region With Regard To A Data Point
kNN (k+x)NN , where x is the number of auxiliary points
assume that z is the farthest known point to qb, i.e., the (k + x)th NN of qb
Known region
Reliable
Reliable region : dist(q′, p) ≤ dist(qb, z) − dist(qb, q′).
Safe region with regard to the data point
DM+ Page 8
![Page 9: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/9.jpg)
Safe Region With Regard To A Data Point
DM+ Page 9
![Page 10: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/10.jpg)
V*-kNN
Combine Fixed-Rank Region with Safe Region With Regard To A Data Point integrated safe region (ISR)
DM+ Page 10
![Page 11: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/11.jpg)
ALGORITHM
DM+ Page 11
![Page 12: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/12.jpg)
EXAMPLE
DM+ Page 12
![Page 13: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/13.jpg)
ADVANTAGES
The V*-kNN has the following key advantages:
(i) It requires no precomputation
(ii) It incrementally computes answers and therefore efficiently adapts to changes – such as insertions and deletions of objects, as well as, dynamically changing values of k
DM+ Page 13
![Page 14: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/14.jpg)
EXPERIMENT
DM+ Page 14
![Page 15: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/15.jpg)
THE END
Thank you for listening!
DM+ Page 15
![Page 16: Data Management+ Laboratory V*-kNN: an Efficient Algorithm for Moving k Nearest Neighbor Queries Speaker: Adam Adviser: Yuling Hsueh 2009 IEEE International](https://reader035.vdocuments.net/reader035/viewer/2022062803/56649f215503460f94c39755/html5/thumbnails/16.jpg)
THE END
Q & A
DM+ Page 16