Database Paper Browser

Back to papers

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
14322
Venue
VLDB
Year
2026
Pagerank
4.1905499e-05
Overall Rank
10,283 | 28.54%
DOI
10.14778/3811243.3811255

Incoming Non-self Citations Over Time

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

Authors

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