Evaluating path queries over frequently updated route collections

Bouros, P; Sacharidis, D; Dalamagas, T; Skiadopoulos, S; Sellis, T

dc.contributor.author	Bouros, P	en
dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Skiadopoulos, S	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:08:53Z
dc.date.available	2014-03-01T02:08:53Z
dc.date.issued	2012	en
dc.identifier.issn	10414347	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29744
dc.subject	frequent updates	en
dc.subject	path queries	en
dc.subject	Route collections	en
dc.subject.other	Experimental evaluation	en
dc.subject.other	Fast indices	en
dc.subject.other	frequent updates	en
dc.subject.other	Geo-data	en
dc.subject.other	GPS technologies	en
dc.subject.other	Graph-based	en
dc.subject.other	Indexing scheme	en
dc.subject.other	Path queries	en
dc.subject.other	Points of interest	en
dc.subject.other	Route collections	en
dc.subject.other	Search Algorithms	en
dc.subject.other	Two-point	en
dc.subject.other	Waypoints	en
dc.subject.other	Computational methods	en
dc.subject.other	Information systems	en
dc.subject.other	Geographic information systems	en
dc.title	Evaluating path queries over frequently updated route collections	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TKDE.2011.30	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TKDE.2011.30	en
heal.identifier.secondary	5710915	en
heal.publicationDate	2012	en
heal.abstract	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 ns and nt, a path query returns a path, i.e., a sequence of points, that connects ns to nt. 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. © 2012 IEEE.	en
heal.journalName	IEEE Transactions on Knowledge and Data Engineering	en
dc.identifier.doi	10.1109/TKDE.2011.30	en
dc.identifier.volume	24	en
dc.identifier.issue	7	en
dc.identifier.spage	1276	en
dc.identifier.epage	1290	en