Fast analytics on secret-shared dynamic database

What is it about?

Current research primarily focuses on optimizing one-time queries on secret-shared static databases, resulting in unsatisfactory performance when applied to dynamic databases. Our motivation is to leverage existing query results to accelerate queries on dynamic databases. Technically, we design composable query result update algorithms of SQL operators to realize our idea. These algorithms are benefited from two constant-depth circuits we proposed. Experiments on several real-world SQL queries demonstrate the effectiveness of our framework.

Featured Image

Photo by COSMOH LOVE on Unsplash

Photo by COSMOH LOVE on Unsplash

Why is it important?

a) To the best of our knowledge, we are the first to leverage intermediate query results to accelerate queries on secret-shared dynamic databases. b) We propose two constant-depth circuits to support data insertion and deletion which maybe of independent interest. They address the problem of securely inserting/deleting a row into/from an ordered table while keeping the order.

Perspectives