Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs
Summary: Mitigates memory blowup in differential maintenance for recursive graph queries by dropping operator differences and recomputing. Uses deterministic and probabilistic structures to track dropped diffs, enabling scalable DC-based query maintenance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Khaled Ammar (BorealisAI; University of Waterloo)
- 2. Siddhartha Sahu (University of Waterloo)
- 3. Semih Salihoglu (University of Waterloo)
- 4. M. Tamer Özsu (University of Waterloo)
BibTeX Citation
@article{ammar_vldb22,
title = {{Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs}},
author = {Ammar, Khaled and Sahu, Siddhartha and Salihoglu, Semih and Özsu, M. Tamer},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {3186--3198},
doi = {10.14778/3551793.3551862},
url = {https://doi.org/10.14778/3551793.3551862},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,097 | Robust Recursive Query Parallelism in Graph Database Management Systems | 2025 | VLDB | 5.3739121e-05 |
| 11,195 | Dynamic Pruning for Recursive Joins | 2025 | SIGMOD | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 387 | The LDBC Social Network Benchmark: Interactive Workload | 2015 | SIGMOD | 0.00019360364 |
| 444 | Differential dataflow | 2013 | CIDR | 0.0001815754 |
| 1,049 | Graphflow: An Active Graph Database | 2017 | SIGMOD | 0.00012293903 |
| 2,272 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.7108429e-05 |
| 5,690 | iTurboGraph: Scaling and Automating Incremental Graph Analytics | 2021 | SIGMOD | 6.0182427e-05 |
| 9,010 | Graphsurge: Graph Analytics on View Collections Using Differential Computation | 2021 | SIGMOD | 5.2238876e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,553 | Multiple Query Processing in Deductive Databases using Query Graphs | 1986 | VLDB |
| 2 | 5,881 | Scaling-Up In-Memory Datalog Processing: Observations and Techniques | 2019 | VLDB |
| 3 | 10,710 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 4 | 815 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD |
| 5 | 444 | Differential dataflow | 2013 | CIDR |
| 6 | 3,215 | Columnar Storage and List-based Processing for Graph Database Management Systems | 2021 | VLDB |
| 7 | 5,596 | Efficient Main Memory Data Management Using the DBGraph Storage Model | 1990 | VLDB |
| 8 | 7,311 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 9 | 1,253 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 10 | 10,024 | Schema-Based Query Optimisation for Graph Databases | 2025 | SIGMOD |