Subquery Allocation Problem and Heuristics for Secret Sharing Distributed Database System

الملخص EN

We discuss query optimization in a secure distributed database system, called the Secret Sharing Distributed DataBase System (SSDDBS).

We have to consider not only subquery allocations to distributed servers and data transfer on the network but also decoding distributed shared data.

At first, we formulated the subquery allocation problem as a constraints satisfaction problem.

Since the subquery allocation problem is NP-complete in general, it is not easy to obtain the optimal solution in practical time.

Secondly, we proposed a heuristic evaluation function for the best-first search.

We constructed an optimization model on an available optimization software, and evaluated the proposed method.

The results showed that feasible solutions could be obtained by using the proposed method in practical time, and that quality of the obtained solutions was good.