Path skyline for moving objects

초록

Skyline query has been used mainly for relatively static and low dimensional data sets. We develop the Skyline query for the moving objects coping with dynamic changes efficiently. This study is focused on deriving a fundamental algorithm for extracting the path skylines so that the Shortest Path based algorithm, named PathSL, can generate an optimal skyline for moving objects. It turns out that PathSL is robust against changing the source and destination and generically scalable for the problem size with polynomial computational complexity. © 2012 Springer-Verlag Berlin Heidelberg.