Skyband-Set for Answering Top-k Set Queries of Any Users
Skyband-Set for Answering Top-k Set Queries of Any Users
复制标题
Skyband-Set 用于回答任何用户的 Top-k 集查询
DOI：
10.1007/978-3-319-16313-0_4
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
and Yasuhiko Morimoto
中科院分区：
文献类型：
--
作者：
Md. Anisuzzaman Siddique;Asif Zaman;and Yasuhiko Morimoto
天际线计算无法响应各种查询，这些查询不仅需要分析数据集的单个对象，还需要分析它们的组合。因此，SET Skyline在过去几年中引起了相当大的研究关注。在本文中，我们提出了一种新的集合天际线查询，称为“天带集合”查询。我们考虑了在数值数据库中选择具有代表性的独特对象集的问题。设为每个集合中的对象数，而不是数据库中的对象总数。数据库中的对象集的数量为TonCs。我们提出了一个有效的算法来计算基数从1吨到1吨的Csset的Skyband集。我们研究了Skyband-Set查询计算的性质，并提出了剪枝策略，以避免不必要的对象集枚举以及它们之间的比较。通过实验验证了该算法的有效性和高效性。
Skyline computation fails to response variant queries that need to analyze not just individual object of a dataset but also their combinations. Therefore set skyline has attracted considerable research attention in the past few years. In this paper, we propose a novel variant of set skyline query called the “skyband-set” query. We consider a problem to select representative distinctive objectsets in a numerical database. Letsbe the number of objects in each set andnbe the total number of objects in the database. The number of objectsets in the database amounts tonCs. We propose an efficient algorithm to compute skyband-set of thenCssets where the cardinality ofsvaries from 1 ton. We investigate properties of skyband-set query computation and develop pruning strategies to avoid unnecessary objectset enumerations as well as comparisons among them. We conduct a set of experiments to show the effectiveness and efficiency of the propose algorithm.