Flexible Skylines

Author:

Ciaccia Paolo1,Martinenghi Davide2

Affiliation:

1. Università di Bologna, Bologna, Italy

2. Politecnico di Milano, Milan, Italy

Abstract

Skyline and ranking queries are two popular, alternative ways of discovering interesting data in large datasets. Skyline queries are simple to specify, as they just return the set of all non-dominated tuples, thereby providing an overall view of potentially interesting results. However, they are not equipped with any means to accommodate user preferences or to control the cardinality of the result set. Ranking queries adopt, instead, a specific scoring function to rank tuples, and can easily control the output size. While specifying a scoring function allows one to give different importance to different attributes by means of, e.g., weight parameters, choosing the “right” weights to use is known to be a hard problem. In this article, we embrace the skyline approach by introducing an original framework able to capture user preferences by means of constraints on the weights used in a scoring function, which is typically much easier than specifying precise weight values. To this end, we introduce the novel concept of F-dominance , i.e., dominance with respect to a family of scoring functions F : a tuple t is said to F -dominate tuple s when t is always better than or equal to s according to all the functions in F . Based on F -dominance, we present two flexible skyline (F-skyline) operators, both returning a subset of the skyline: nd , characterizing the set of non- F -dominated tuples; po , referring to the tuples that are also potentially optimal, i.e., best according to some function in F . While nd and po coincide and reduce to the traditional skyline when F is the family of all monotone scoring functions, their behaviors differ when subsets thereof are considered. We discuss the formal properties of these new operators, show how to implement them efficiently, and evaluate them on both synthetic and real datasets.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. rkHit: Representative Query with Uncertain Preference;Proceedings of the ACM on Management of Data;2023-06-13

2. Hybrid Regret Minimization: A Submodular Approach;IEEE Transactions on Knowledge and Data Engineering;2023

3. Efficient processing of k-regret minimization queries with theoretical guarantees;Information Sciences;2022-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3