DAG Reduction: Fast Answering Reachability Queries
Summary: Proposes DAG reduction to accelerate reachability queries by shrinking DAGs with transitive reduction (TR) and equivalence reduction (ER). buTR yields the smallest DAG with the same transitive closure; linear-ER compresses further in linear time for scalable reachability on large graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Junfeng Zhou (Donghua University; Yanshan University)
- 2. Shijie Zhou (Yanshan University)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 4. Hao Wei (Chinese University of Hong Kong)
- 5. Ziyang Chen (Shanghai Lixin University of Accounting and Finance)
- 6. Xian Tang (Yanshan University)
BibTeX Citation
@inproceedings{zhou_sigmod17,
title = {{DAG Reduction: Fast Answering Reachability Queries}},
author = {Zhou, Junfeng and Zhou, Shijie and Yu, Jeffrey Xu and Wei, Hao and Chen, Ziyang and Tang, Xian},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3035927},
url = {https://dl.acm.org/doi/10.1145/3035918.3035927},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 927 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00013161079 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 2 | 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB |
| 3 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 4 | 4,474 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 5 | 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD |
| 6 | 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD |
| 7 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 8 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 9 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 10 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |