Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms.
Shumo ChuDanyang ZhuoElaine ShiT.-H. Hubert ChanPublished in: IACR Cryptol. ePrint Arch. (2021)
Keyphrases
- theoretical analysis
- error bounds
- database
- worst case
- databases
- metadata
- computational complexity
- high dimensional
- relational databases
- computationally efficient
- running times
- access methods
- average case
- space complexity
- r tree
- high dimensional data
- dimensionality reduction
- query language
- data model
- data structure
- data sets