2022/01/25 by Vittorio Fabris, Fabris, Vittorio · 1 citation
Computer Science · Social Sciences · #Constraint Satisfaction and Optimization #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #Geographic Information Systems Studies
paper · pdf · doi:10.48550/arxiv.2201.10179
openalex publication_date 2022/01/25 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
Recent studies pointed out some limitations about classic top-k queries and skyline queries. Ranking queries impose the user to provide a specific scoring function, which can lead to the exclusion of interesting results because of the inaccurate estimation of the assigned weights. The skyline approach makes it difficult to always retrieve an accurate result, in particular when the user has to deal with a dataset whose tuples are defined by semantically different attributes. Therefore, to improve the quality of the final solutions, new techniques have been developed and proposed: here we will discuss about the flexible skyline, regret minimization and skyline ranking approaches. We present a comparison between the three different operators, recalling their way of behaving and defining a guideline for the readers so that it is easier for them to decide which one, among these three, is the best technique to apply to solve their problem.