Privacy Aware Parallel Computation of Skyline Sets Queries from Distributed Databases

Authors

  • Mohammad Shamsul Arefin Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima 739-8521, Japan & Department of Computer Science and Engineering, Chittagong University of Engineering and Technology, Chittagong-4349
  • Yasuhiko Morimoto Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima 739-8521

Keywords:

Skyline sets, convex skyline, parallel computation, agent-based computation, compromisable situations

Abstract

A skyline query finds objects that are not dominated by another object from a given set of objects. Skyline queries help us to filter unnecessary information efficiently and provide us clues for various decision making tasks. However, we cannot use skyline queries in privacy aware environment, since we have to hide individual's records values even though there is no ID information. Therefore, we considered skyline sets queries. The skyline set query returns skyline sets from all possible sets, each of which is composed of some objects in a database. With the growth of network infrastructure data are stored in distributed databases. In this paper, we expand the idea to compute skyline sets queries in parallel fashion from distributed databases without disclosing individual records to others. The proposed method utilizes an agent-based parallel computing framework that can efficiently compute skyline sets queries and can solve the privacy problems of skyline queries in distributed environment. The computation of skyline sets is performed simultaneously in all databases which increases parallelism and reduces the computation time.

Downloads

Download data is not yet available.

Downloads

Published

2015-02-10

How to Cite

Arefin, M. S., & Morimoto, Y. (2015). Privacy Aware Parallel Computation of Skyline Sets Queries from Distributed Databases. Computing and Informatics, 33(4), 831–856. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/990