Abstract
The k-dominant skyline query which can return small result set in high dimensional space is very convenient for user to make decision. But all the existent algorithms are for single dataset, not suitable for two or more datasets being combined. To solve this problem, this paper proposed a new idea to get the new k-dominant skyline by computing the partial points of each dataset based on their existent k-dominant skylines. Furthermore, detailed theoretical analyses and extensive experiments demonstrate that the algorithms can effectively reduce redundant work, and keep the result correctly.
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.
