Computing range skyline query on uncertain dimension

A user sometimes prefers to not be restricted when querying for information. Querying information within a range of search often provides a different perspective to user as opposed to a rigid search. To compute skyline within a given range would be easy on traditional dataset. The challenge is when the dataset being queried consists of both atomic values as well as continuous range of values. For a set of objects with uncertain dimension, a skyline with a range query [qj:q′j] on that uncertain dimension returns objects which are not dominated by any other objects in the range query. A method is proposed to determine objects and answer skyline query that satisfy the range query. The correctness of the method is proven through comparisons between two naïve methods that strictly reject and loosely accept objects that intersect with the range query.

Text Computing range skyline query on uncertain dimension.pdf Download (56kB) Official URL or Download Paper: https://link.springer.com/chapter/10.1007/978-3-31...

Actions (login required)

View Item