Issue No. 07 - July (2012 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.30
Panagiotis Bouros , National Technical University of Athens, Athens
Dimitris Sacharidis , Athena Research Center, Athens
Theodore Dalamagas , Athena Research Center, Athens
Spiros Skiadopoulos , University of Peloponnese, Tripolis
Timos Sellis , Athena Research Center, Athens
The recent advances in the infrastructure of Geographic Information Systems (GIS), and the proliferation of GPS technology, have resulted in the abundance of geodata in the form of sequences of points of interest (POIs), waypoints, etc. We refer to sets of such sequences as route collections. In this work, we consider path queries on frequently updated route collections: given a route collection and two points n_s and n_t, a path query returns a path, i.e., a sequence of points, that connects n_s to n_t. We introduce two path query evaluation paradigms that enjoy the benefits of search algorithms (i.e., fast index maintenance) while utilizing transitivity information to terminate the search sooner. Efficient indexing schemes and appropriate updating procedures are introduced. An extensive experimental evaluation verifies the advantages of our methods compared to conventional graph-based search.
Route collections, path queries, frequent updates.
D. Sacharidis, T. Sellis, P. Bouros, T. Dalamagas and S. Skiadopoulos, "Evaluating Path Queries over Frequently Updated Route Collections," in IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 1276-1290, 2011.