Daisy Seminar

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
**Department news**: \\
From 2012, seminar room is changing to a bigger one, for this year (2011) we are staying at old 0.2.15

**Presentation (discussion)** \\

This Friday Benjamin will present the paper: [[http://www.google.dk/url?sa=t&rct=j&q=scalable%20network%20browsing&source=web&cd=2&ved=0CDkQFjAB&url=http%3A%2F%2Fwww.umiacs.umd.edu%2F~hjs%2Fpubs%2Fsigmod08.pdf&ei=OJPnTpiiMcLb4QS9lbzyCA&usg=AFQjCNEsHbOFmXZn0RQbU-EELcBdJ59uuw&sig2=88YVwX40RCvtNDer1KbR3g&cad=rja|Scalable Network Distance Browsing in Spatial Databases]]


**Abstract**\\
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes advantage of the fact that the shortest paths from vertex u to all of the remaining vertices can be decomposed into subsets based on the first edges on the shortest paths to them from u. Thus, in the worst case, the amount of work depends on the number of objects that are examined and the number of links on the shortest paths to them from q, rather than depending on the number of vertices in the network. The amount of storage required to keep track of the subsets is reduced by taking advantage of their spatial coherence which is captured by the aid of a shortest path quadtree. In particular, experiments on a number of large road networks as....

**Attendance:**\\
  * Ove Andersen
  * Andreas Weisberg
  * Darius Sidlauskas
  * Kurt Nørmark
  * Bent Thomsen
  * Yoann Pitarch
  * Mohamed Khalefa
  * Hua Lu
  * Simonas Saltenis
  * Benjamin Krogh (presenter)