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
- 1. Jelle Hellings (Hasselt University; Transnational University of Limburg)
- 2. George H.L. Fletcher (Eindhoven University of Technology)
- 3. Herman Haverkort (Eindhoven University of Technology)
BibTeX Citation
@inproceedings{hellings_sigmod12,
title = {{Efficient External-Memory Bisimulation on DAGs}},
author = {Hellings, Jelle and Fletcher, George H.L. and Haverkort, Herman},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213899},
url = {https://dl.acm.org/doi/10.1145/2213836.2213899},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 594 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015979077 |
| 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 718 | Covering Indexes for Branching Path Queries | 2002 | SIGMOD | 0.00014642961 |
| 2,472 | Path Queries on Compressed XML | 2003 | VLDB | 8.5327655e-05 |
| 3,421 | Updates for Structure Indexes | 2002 | VLDB | 7.4273213e-05 |
| 5,511 | A Quest for Beauty and Wealth (or, Business Processes for Database Researchers) | 2011 | PODS | 6.1915384e-05 |
| 5,952 | Efficient Processing of XML Path Queries Using the Disk-based F&B Index | 2005 | VLDB | 6.031089e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,659 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS |
| 2 | 3,450 | Keyword Search on External Memory Data Graphs | 2008 | VLDB |
| 3 | 6,014 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB |
| 4 | 7,707 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD |
| 5 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |
| 6 | 2,625 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB |
| 7 | 7,494 | Hash-based Subgraph Query Processing Method for Graph-structured XML Documents | 2008 | VLDB |
| 8 | 1,523 | Efficient Structural Joins on Indexed XML Documents | 2002 | VLDB |
| 9 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 10 | 3,421 | Updates for Structure Indexes | 2002 | VLDB |