Abstract
Given a set of elements \(\mathcal{D}\) in a d-dimensional space, a k-skyband query returns all elements which are worse than at most k other elements. The k-skyband query is a fundamental analysis query. It can offer minimal candidate set for other queries such as top-k ranking query where the ranking functions are monotonic. With the development of multicore processors, it has been a trend that more algorithms focus on parallel execution to exploit the computation resources. In this paper, rather than use traditional methods to compute k-skyband, we employ parallel techniques to get the result efficiently based on multicore architecture. Extensive experiments show the efficiency and effectiveness of our proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
