Evaluating path queries over route collections

Bouros, P; Vassiliou, Y

dc.contributor.author	Bouros, P	en
dc.contributor.author	Vassiliou, Y	en
dc.date.accessioned	2014-03-01T02:46:47Z
dc.date.available	2014-03-01T02:46:47Z
dc.date.issued	2010	en
dc.identifier.issn	10844627	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32849
dc.subject	Point of Interest	en
dc.subject	Shortest Path	en
dc.subject.other	Constrained shortest path	en
dc.subject.other	Geo-data	en
dc.subject.other	Open problems	en
dc.subject.other	Path queries	en
dc.subject.other	Points of interest	en
dc.subject.other	Routing data	en
dc.title	Evaluating path queries over route collections	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICDEW.2010.5452732	en
heal.identifier.secondary	5452732	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICDEW.2010.5452732	en
heal.publicationDate	2010	en
heal.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. © 2010 IEEE.	en
heal.journalName	Proceedings - International Conference on Data Engineering	en
dc.identifier.doi	10.1109/ICDEW.2010.5452732	en
dc.identifier.spage	325	en
dc.identifier.epage	328	en