Optimal oblivious algorithms for multi-way joins

DOI10.4230/LIPICS.ICDT.2025.25MaRDI QIDQ7292793zbMATH OpenFDO

Authors Xiao Hu, Zhiang Wu

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.25

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• Cache-oblivious algorithms
• Can we overcome the n n barrier for oblivious sorting?
• Communication steps for parallel query processing
• Degrees of acyclicity for hypergraphs and relational database schemes
• Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms
• Foundations of differentially oblivious algorithms
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Hypertree decompositions and tractable queries
• I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• On the Desirability of Acyclic Database Schemes
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Optimizing ORAM and Using It Efficiently for Secure Computation
• OptORAMa: optimal oblivious RAM
• Path ORAM
• Query evaluation via tree-decompositions
• Software protection and simulation on oblivious RAMs
• Subgraph enumeration in optimal I/O complexity
• Worst-case optimal join algorithms

This page was built for publication: Optimal oblivious algorithms for multi-way joins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292793)