High Parallel Skyline Computation over Low-Cardinality Domains

摘要: A Skyline query retrieves all objects in a dataset that are not dominated by other according to some given criteria. Although there few parallel algorithms on multicore processors, it is still challenging task fully exploit the advantages of such modern hardware architectures for efficient computation. In this paper we present high-performance based lattice structure generated query. We compare our methods with state-of-the-art processing. Experimental results synthetic and real datasets show new outperform techniques low-cardinality domains. Our have linear runtime complexity play architectures.