On Skylining with Flexible Dominance Relation
Tian Xia
Donghui Zhang
Yufei Tao
Coll. of Comput. & Inf. Sci., Northeastern Univ., Boston, MA;
This paper appears in: Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Publication Date: 7-12 April 2008
On page(s): 1397-1399
Location: Cancun,
ISBN: 978-1-4244-1836-7
INSPEC Accession Number: 9963624
Digital Object Identifier: 10.1109/ICDE.2008.4497568
Current Version Published: 2008-04-25
Abstract
Given a set of d dimensional objects, a skyline query finds the objects ("skyline") that are not dominated by others. However, skylines do not always provide useful query results to users, and existing methods of various skyline queries have at least one of the following drawbacks: (1) the size of skyline objects can not be controlled, or can be only increased or only decreased butnotboth; (2) skyline objects do not have built-in ranks; (3) skylines do not reflect users' weights (preferences) at different dimensions. In this paper, we propose a unified approach, the epsiv-skyline, to effectively solve all three drawbacks. We explore the properties of epsiv-skylines and propose two different algorithms to compute epsiv-skylines.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
