An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Controlled Information Sharing in Collaborative Distributed Query Processing
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hi-index | 0.00 |
In this paper, we consider the scenario where a set of parties need to cooperate with one another. To safely exchange the information, a set of authorization rules is given to the parties. In some cases, a trusted third party is required to perform the expected operations. Since interactions with the third party can be expensive and there maybe risk of data exposure/misuse, it is important to minimize their use. We formulate the minimization problem and show the problem is in NP-hard. We then propose a greedy algorithm to find close to optimal solutions.