Sciweavers

TKDE
2011

On Computing Farthest Dominated Locations

12 years 10 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , if p is no worse than p with respect to every quality attribute and p is better on at least one quality attribute. Traditional spatial queries (e.g., nearest neighbor, closest pair) ignore quality attributes, whereas conventional dominance-based queries (e.g., skyline) neglect spatial locations. Motivated by these observations, we propose a novel query by combining spatial and quality attributes together meaningfully. Given a set of (competitors’) spatial objects P, a set of (candidate) locations L, and a quality vector Ψ as design competence (for L), the farthest dominated location query (FDL) retrieves the location s ∈ L such that the distance to its nearest dominating object in P is maximized. FDL queries are suitable for various spatial decision support applications such as business planning, wild an...
Hua Lu, Man Lung Yiu
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TKDE
Authors Hua Lu, Man Lung Yiu
Comments (0)