Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02279-1_29 | SSDBM |
Keywords | Field | DocType |
reachability queries,reachability query,large volume,reachability information,path collection,interesting query,indexing structure,path collections,extensive experimental evaluation,path-first search paradigm,first-class citizen,sequential data | Sequential data,Data mining,Computer science,Search engine indexing,Reachability,Theoretical computer science | Conference |
Volume | ISSN | Citations |
5566 | 0302-9743 | 13 |
PageRank | References | Authors |
0.65 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Panagiotis Bouros | 1 | 152 | 18.01 |
| Spiros Skiadopoulos | 2 | 1139 | 65.60 |
| Theodore Dalamagas | 3 | 792 | 61.84 |
| Dimitris Sacharidis | 4 | 403 | 33.17 |
| Timos K. Sellis | 5 | 4970 | 1255.07 |