Top-k Combinatorial Skyline Queries
Top-k Combinatorial Skyline Queries
复制标题
DOI：
10.1007/978-3-642-12098-5_6
复制
发表时间：
2010-04
期刊：
影响因子：
--
通讯作者：
I-Fang Su;Yu-Chi Chung;Chiang Lee
中科院分区：
文献类型：
--
作者：
I-Fang Su;Yu-Chi Chung;Chiang Lee
top-kskyline计算问题在过去的几年中引起了相当大的研究关注。给定一个数据集，top-kskyline根据用户指定的某种偏好返回“最有趣的”skyline元组。我们扩展了top-kskyline的概念，所谓的top-kcombinatorial skyline查询（k-CSQ）。与现有的top-kskyline查询（主要是寻找感兴趣的skyline元组）不同，ak-CSQ是从给定元组的各种组合中寻找感兴趣的skyline元组。K-CSQ是决策制定、市场分析、商业规划和定量经济学研究等领域的重要工具。在本文中，我们将正式定义这个新的问题，提出了一个智能的方法来解决这个问题，也进行了一组实验，以显示所提出的算法的有效性和效率。
The problem of top-kskyline computation has attracted considerable research attention in the past few years. Given a dataset, a top-kskyline returnsk“most interesting” skyline tuples based on some kind of preference specified by the user. We extend the concept of top-kskyline to a so-called top-kcombinatorial skyline query (k-CSQ). In contrast to the existing top-kskyline query (which is mainly to find the interesting skyline tuples), ak-CSQ is to find the interesting skyline tuples from various kinds of combinations of the given tuples. Thek-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.