Efficient External-Memory Bisimulation on DAGs
Summary: First external-memory DAG bisimulation algorithm with IO complexity O(Sort(|N|+|E|)). Scales to billions of nodes/edges in XML/provenance; open-source C++ implementation provided for practical use. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 12,041 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 817 | Covering Indexes for Branching Path Queries | 2002 | SIGMOD | 0.00016352717 |
| 2,507 | Path Queries on Compressed XML | 2003 | VLDB | 8.6311009e-05 |
| 3,466 | Updates for Structure Indexes | 2002 | VLDB | 7.0695018e-05 |
| 5,364 | A Quest for Beauty and Wealth (or, Business Processes for Database Researchers) | 2011 | PODS | 5.5461492e-05 |
| 5,820 | Efficient Processing of XML Path Queries Using the Disk-based F&B Index | 2005 | VLDB | 5.3135144e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,183 | Keyword Search on External Memory Data Graphs | 2008 | VLDB | 9.3439219e-05 |
| 3,695 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8345021e-05 |
| 6,241 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.1411469e-05 |
| 7,596 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD | 4.7016964e-05 |
| 1,635 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001105793 |
| 2,855 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB | 8.0059865e-05 |
| 7,367 | Hash-based Subgraph Query Processing Method for Graph-structured XML Documents | 2008 | VLDB | 4.7514687e-05 |
| 1,733 | Efficient Structural Joins on Indexed XML Documents | 2002 | VLDB | 0.00010724888 |
| 12,041 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1945683e-05 |
| 3,466 | Updates for Structure Indexes | 2002 | VLDB | 7.0695018e-05 |