Algorithm for Computing Convex Skyline Objectsets on Numerical Databases

• SIDDIQUE Md. Anisuzzaman

  Hiroshima University

• MORIMOTO Yasuhiko

  Hiroshima University

Abstract

Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let s be the number of objects in each set and n be the number of objects in the database. The number of sets in the database amounts to _nC_s. We propose an efficient algorithm to compute convex skyline of the _nC_s sets. We call the retrieve skyline objectsets as “convex skyline objectsets”. Experimental evaluation using real and synthetic datasets demonstrates that the proposed skyline objectset query is meaningful and is scalable enough to handle large and high dimensional databases. Recently, we have to aware individual's privacy. Sometimes, we have to hide individual values and are only allowed to disclose aggregated values of objects. In such situation, we cannot use conventional skyline queries. The proposed function can be a promising alternative in decision making in a privacy aware environment.

Journal

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E93-D (10), 2709-2716, 2010

  The Institute of Electronics, Information and Communication Engineers

Keywords

• skyline query
• privacy
• skyline objectsets

Details

• CRID: 1390001204379516032
• NII Article ID: 10027641039
• NII Book ID: AA10826272
• DOI: 10.1587/transinf.e93.d.2709
• ISSN: 17451361
• ISSN: 09168532
• Web Site: http://www.jstage.jst.go.jp/article/transinf/E93.D/10/E93.D_10_2709/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed