A Greedy Approach to Answer Reachability Queries on DAGs
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, and Paolo Pasini, Stefano Quer

TL;DR
This paper introduces a greedy algorithm for constructing reachability indexes on DAGs that approximates the optimal chain decomposition efficiently, enabling faster queries with minimal accuracy loss.
Contribution
It presents a novel greedy approach to decompose DAGs into near-optimal chains for reachability indexing, improving scalability and practicality over existing complex methods.
Findings
Produces chain decompositions close to optimal in experiments
Reduces computation time significantly compared to existing methods
Applicable to large graphs from various domains
Abstract
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive closure compression. Transitive closure compression techniques usually construct a graph reachability index, for example by decomposing the graph into disjoint chains. As memory consumption is proportional to the number of chains, the target of those algorithms is to decompose the graph into an optimal number \width\ of chains. However, commonly used techniques fail to meet general expectations, are exceedingly complex, and their application on large graphs is impractical. The main contribution of this paper is a novel approach to construct such reachability indexes. The proposed method decomposes the graph into a sub-optimal number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, Reasoning, and Knowledge · Advanced Database Systems and Queries
