1 / 5

Evaluating Reachability Queries over Path Collections

This paper presents an innovative approach for evaluating reachability queries over dynamic path collections, addressing challenges posed by large datasets and frequent updates. We define the problem of identifying paths between nodes within a continuously changing graph structure. Our method involves merging paths to create an underlying graph and utilizing advanced graph search algorithms to efficiently handle queries. Key contributions include the development of the P-Index and H-Index for indexing path collections and connections. This approach optimizes depth-first search techniques to manage node visits effectively, enhancing query performance.

tybalt
Download Presentation

Evaluating Reachability Queries over Path Collections

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Evaluating Reachability Queries over Path Collections P. Bouros1, S. Skiadopoulos2, T. Dalamagas3, D. Sacharidis3, T. Sellis1,3 1National Technical University of Athens 2University of Peleponnese 3Institute for Management of Information Systems – R.C. Athena SSDBM'09

  2. Motivating example SSDBM'09

  3. Problem definition • Large path collections • Frequent updates • New paths • Evaluating reachability queries • Is there a path from node F to C? • Find a path from node F to C • Path collection SSDBM'09

  4. Solving the problem • Using a graph • Merge paths to build underlying graph • Apply graph search algorithm for queries • Our approach • Algorithm pfs • Visit nodes in paths in depth-first way • Push to dfs stack set of nodes at once • Index path collections, P-Index, pfsP • Index path connections, H-graph & H-Index, pfsH SSDBM'09

  5. Thank you! SSDBM'09

More Related