PathTree (SIGMOD'08)
PathTree is the implementation of algorithm pathtree for answering reachability query in DAG (directed acyclic graph). The algorithm is introduced in our SIGMOD'08 paper, Efficiently Answering Reachability Queries on Very Large Directed Graph.- Code: pathtree_sigmod08 (version 2.0 is under development, and will be provided)
- Dataset: dataset_sigmod08
3HOP (SIGMOD'09)
3HOP_segment and 3HOP_contour are two implementations of algorithm 3-HOP for answering reachability query in DAG (directed acyclic graph) with highly compressed labels. The algorithm is presented in our SIGMOD'09 paper, 3-HOP: A High-Compression Indexing Scheme for Reachability Query.- Code: 3hop_sigmod09
- Dataset: dataset_sigmod09