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 |
|---|---|---|---|---|
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1905499e-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 |
|---|---|---|---|---|
| 812 | Covering Indexes for Branching Path Queries | 2002 | SIGMOD | 0.00016343476 |
| 2,509 | Path Queries on Compressed XML | 2003 | VLDB | 8.6250598e-05 |
| 3,468 | Updates for Structure Indexes | 2002 | VLDB | 7.0634268e-05 |
| 5,374 | A Quest for Beauty and Wealth (or, Business Processes for Database Researchers) | 2011 | PODS | 5.5408029e-05 |
| 5,831 | Efficient Processing of XML Path Queries Using the Disk-based F&B Index | 2005 | VLDB | 5.308804e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,697 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8281158e-05 |
| 2,190 | Keyword Search on External Memory Data Graphs | 2008 | VLDB | 9.3356692e-05 |
| 6,240 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.1362097e-05 |
| 7,595 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD | 4.6980168e-05 |
| 1,630 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.00011073047 |
| 2,862 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB | 7.9982917e-05 |
| 7,362 | Hash-based Subgraph Query Processing Method for Graph-structured XML Documents | 2008 | VLDB | 4.7469116e-05 |
| 1,732 | Efficient Structural Joins on Indexed XML Documents | 2002 | VLDB | 0.00010716665 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1905499e-05 |
| 3,468 | Updates for Structure Indexes | 2002 | VLDB | 7.0634268e-05 |