DBScholar

Back to papers

Jodes: Efficient Oblivious Join in the Distributed Setting

Summary: Jodes is an oblivious distributed equi-join that hides both enclave access patterns and inter-server communication volumes, revealing only input and output sizes. It achieves asymptotically lower communication and computation costs, with up to 6× speedup over prior joins. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13985
Venue
VLDB
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,816 | 25.80%
DOI
10.14778/3718057.3718060

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{wang_vldb25,
        title = {{Jodes: Efficient Oblivious Join in the Distributed Setting}},
        author = {Wang, Yilei and Zeng, Xiangdong and Wang, Sheng and Li, Feifei},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {5},
        pages = {1291--1304},
        doi = {10.14778/3718057.3718060},
        url = {https://doi.org/10.14778/3718057.3718060},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,249 Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store 2025 SIGMOD 5.4574671e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 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,424 Azure SQL Database Always Encrypted 2020 SIGMOD 0.00010819191
1,448 Skew in Parallel Query Processing 2014 PODS 0.00010758872
1,459 SMCQL: Secure Querying for Federated Databases 2017 VLDB 0.00010717725
1,998 A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries 2017 PODS 9.3363505e-05
2,045 Efficient Oblivious Database Joins 2020 VLDB 9.2632279e-05
2,417 Towards Practical Oblivious Join 2022 SIGMOD 8.6061949e-05
2,462 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 8.5487602e-05
2,537 Secure Database-as-a-Service with Cipherbase 2013 SIGMOD 8.4549061e-05
2,573 Secure Yannakakis: Join-Aggregate Queries over Private Data 2021 SIGMOD 8.4015654e-05
3,131 HEDA: Multi-Attribute Unbounded Aggregation over Homomorphically Encrypted Database 2023 VLDB 7.7249939e-05
3,464 Building Enclave-Native Storage Engines for Practical Encrypted Databases 2021 VLDB 7.3916399e-05
4,371 Instance and Output Optimal Parallel Algorithms for Acyclic Joins 2019 PODS 6.738679e-05
4,979 Full Encryption: An end to end encryption mechanism in GaussDB 2021 VLDB 6.4149394e-05
5,463 Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins 2021 PODS 6.2086169e-05
6,386 Operon: An Encrypted Database for Ownership-Preserving Data Management 2022 VLDB 5.8899805e-05
6,398 Query Evaluation by Circuits 2022 PODS 5.8867918e-05
7,143 Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries 2020 PODS 5.6915726e-05
7,165 Flare: A Fast, Secure, and Memory-Efficient Distributed Analytics Framework 2023 VLDB 5.6847858e-05
9,476 SODA: A Set of Fast Oblivious Algorithms in Distributed Secure Data Analytics 2023 VLDB 5.2634238e-05
Previous Page 1 / 1 Next

Semantically Similar Papers