dc.contributor.author |
Bouros, P |
en |
dc.contributor.author |
Skiadopoulos, S |
en |
dc.contributor.author |
Dalamagas, T |
en |
dc.contributor.author |
Sacharidis, D |
en |
dc.contributor.author |
Sellis, T |
en |
dc.date.accessioned |
2014-03-01T02:46:08Z |
|
dc.date.available |
2014-03-01T02:46:08Z |
|
dc.date.issued |
2009 |
en |
dc.identifier.issn |
03029743 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/32571 |
|
dc.subject |
Path collections |
en |
dc.subject |
Reachability queries |
en |
dc.subject.other |
Experimental evaluation |
en |
dc.subject.other |
Indexing structures |
en |
dc.subject.other |
Path collections |
en |
dc.subject.other |
Reachability |
en |
dc.subject.other |
Reachability queries |
en |
dc.subject.other |
Sequential data |
en |
dc.subject.other |
Work Focus |
en |
dc.subject.other |
Biochemistry |
en |
dc.subject.other |
Management information systems |
en |
dc.title |
Evaluating reachability queries over path collections |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1007/978-3-642-02279-1_29 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/978-3-642-02279-1_29 |
en |
heal.publicationDate |
2009 |
en |
heal.abstract |
Several applications in areas such as biochemistry, GIS, involve storing and querying large volumes of sequential data stored as path collections. There is a number of interesting queries that can be posed on such data. This work focuses on reachability queries: given a path collection and two nodes v s, v t, determine whether a path from v s to v t exists and identify it. To answer these queries, the path-first search paradigm, which treats paths as first-class citizens, is proposed. To improve the performance of our techniques, two indexing structures that capture the reachability information of paths are introduced. Further, methods for updating a path collection and its indices are discussed. Finally, an extensive experimental evaluation verifies the advantages of our approach. © 2009 Springer Berlin Heidelberg. |
en |
heal.journalName |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
en |
dc.identifier.doi |
10.1007/978-3-642-02279-1_29 |
en |
dc.identifier.volume |
5566 LNCS |
en |
dc.identifier.spage |
398 |
en |
dc.identifier.epage |
416 |
en |