Evaluating path queries over route collections

12 years 3 months ago
Evaluating path queries over route collections
Abstract— Nowadays, vast amount of routing data, like sequences of points of interests, landmarks, etc., are available due to the proliferation of geodata services. We refer to these sequences as routes and the involved points simply as nodes. In this thesis, we consider the problem of evaluating path queries on frequently updated route collections. We present our current work for two path queries: (i) identifying a path between two nodes of the collection, and (ii) identifying a constrained shortest path. Finally, some interesting open problems are described and our future work directions are clearly stated.
Panagiotis Bouros, Y. Vassiliou
Added 06 Dec 2010
Updated 06 Dec 2010
Type Conference
Year 2010
Where ICDE
Authors Panagiotis Bouros, Y. Vassiliou
Comments (0)