Top-k combinatorial skyline querie

I. Fang Su, Yu Chi Chung, Chiang Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Citations (Scopus)


The problem of top-k skyline computation has attracted considerable research attention in the past few years. Given a dataset, a top-k skyline returns k "most interesting" skyline tuples based on some kind of preference specified by the user. We extend the concept of top-k skyline to a so-called top-k combinatorial skyline query (k-CSQ). In contrast to the existing top-k skyline query (which is mainly to find the interesting skyline tuples), a k-CSQ is to find the interesting skyline tuples from various kinds of combinations of the given tuples. The k-CSQ is an important tool for areas such as decision making, market analysis, business planning, and quantitative economics research. In this paper, we will formally define this new problem, propose an intelligent method to resolve this problem, and also conduct a set of experiments to show the effectiveness and efficiency of the proposed algorithm.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings
Number of pages15
EditionPART 2
Publication statusPublished - 2010 Dec 28
Event15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 - Tsukuba, Japan
Duration: 2010 Apr 12010 Apr 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other15th International Conference on Database Systems for Advanced Applications, DASFAA 2010

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Top-k combinatorial skyline querie'. Together they form a unique fingerprint.

Cite this