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)

Paper ID: 14509
Venue: VLDB
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,570 | 27.49%
DOI: 10.14778/3811243.3811255

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Weiqi Feng (University of Massachusetts Amherst)
2. Xinle Cao (OceanBase, Ant Group)
3. Adam O'Neill (University of Massachusetts Amherst)
4. Chuanhui Yang (OceanBase, Ant Group)

BibTeX Citation

@article{feng_vldb26,
        title = {{Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications}},
        author = {Feng, Weiqi and Cao, Xinle and O'Neill, Adam and Yang, Chuanhui},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {8},
        pages = {1826--1839},
        doi = {10.14778/3811243.3811255},
        url = {https://doi.org/10.14778/3811243.3811255},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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.

Rank	Cited Paper	Year	Venue	Pagerank
1,615	Arx: An Encrypted Database using Semantically Secure Encryption	2019	VLDB	0.00010214058
2,045	Efficient Oblivious Database Joins	2020	VLDB	9.2632279e-05
2,417	Towards Practical Oblivious Join	2022	SIGMOD	8.6061949e-05
3,293	Modular Order-Preserving Encryption, Revisited	2015	SIGMOD	7.5517336e-05
3,464	Building Enclave-Native Storage Engines for Practical Encrypted Databases	2021	VLDB	7.3916399e-05
3,836	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	7.0827068e-05
4,979	Full Encryption: An end to end encryption mechanism in GaussDB	2021	VLDB	6.4149394e-05
5,299	GraphOS: Towards Oblivious Graph Processing	2023	VLDB	6.2767341e-05
5,444	Oblivious RAM: A Dissection and Experimental Evaluation	2016	VLDB	6.2174128e-05
7,337	OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves	2025	SIGMOD	5.6393827e-05
7,723	Frequency-Hiding Order-Preserving Encryption with Small Client Storage	2021	VLDB	5.5585313e-05
8,434	Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns	2023	SIGMOD	5.4253644e-05
9,384	OasisDB: An Oblivious and Scalable System for Relational Data	2025	VLDB	5.2755515e-05
11,092	Towards Practical Oblivious Map	2025	VLDB	5.093636e-05
11,699	Cryptanalysis of An Encrypted Database in SIGMOD '14	2021	VLDB	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	326	FG-Index: Towards Verification-Free Query Processing on Graph Databases	2007	SIGMOD
2	322	Fast and Practical Indexing and Querying of Very Large Graphs	2007	SIGMOD
3	2,854	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD
4	11,092	Towards Practical Oblivious Map	2025	VLDB
5	3,109	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD
6	2,417	Towards Practical Oblivious Join	2022	SIGMOD
7	3,357	Columnar Storage and List-based Processing for Graph Database Management Systems	2021	VLDB
8	10,221	Differentially Oblivious Multi-way Join	2026	SIGMOD
9	2,045	Efficient Oblivious Database Joins	2020	VLDB
10	5,299	GraphOS: Towards Oblivious Graph Processing	2023	VLDB