Please use this identifier to cite or link to this item:
Title: Dominant skyline query processing
Keywords: skyline, database, optimization
Issue Date: 28-Aug-2006
Citation: ZENG YIMING (2006-08-28). Dominant skyline query processing. ScholarBank@NUS Repository.
Abstract: A skyline query retrieves from a data set, tuples that are not dominated by any other tuples with respect to a set of dimensions. In this thesis, we explored two interesting skyline variants. The first variant, called the dominant skyline queries, retrieves skyline tuples that dominate at least t other tuples. It is used to refine a large set of results to a smaller and more interesting set. The second variant, called the tier-based skyline queries, retrieves a??skylinea?? points from tier 1 to tier k, where tier-k points are skyline points with tier-1 to tier-(k-1) points eliminated from the input. It is meaningful when the skyline result set is too small. We proposed several algorithms to solve these two variants respectively. We have also conducted extensive experiments to study their performance. Through the experiments, we identified some interesting trends and tradeoffs of these algorithms.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf550.02 kBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.