Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications
Summary: Introduces delayed duplication to reconcile strict obliviousness with index-free adjacency (IFA), preserving physical neighbor locality in encrypted graph databases. Grove exploits IFA for expressive graph queries and substantially outperforms prior oblivious systems. (summarized by gpt-5.6-luna on Jul 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Weiqi Feng
- 2. Xinle Cao
- 3. Adam O’Neill
- 4. Chuanhui Yang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 460 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022679846 |
| 351 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026351742 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027077424 |
| 3,147 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4825501e-05 |
| 10,873 | Towards Practical Oblivious Map | 2025 | VLDB | 4.1905499e-05 |
| 3,234 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD | 7.3302974e-05 |
| 3,026 | Towards Practical Oblivious Join | 2022 | SIGMOD | 7.691304e-05 |
| 4,017 | Columnar Storage and List-based Processing for Graph Database Management Systems | 2021 | VLDB | 6.5276062e-05 |
| 2,549 | Efficient Oblivious Database Joins | 2020 | VLDB | 8.5572389e-05 |
| 5,511 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 5.4701773e-05 |