Abstract
This paper analyses the problem of joining two horizontally partitioned relations in a distributed database system using a semi-join strategy. A mathematical model is developed and the problem is proved to be NP-complete with respect to the number of fragments. Lower bounding and heuristic procedures are proposed, and the results of computational experiments are reported. These results reveal a good performance of the heuristic procedures, and demonstrate the benefit (in terms of communication cost savings) of using semi-join operations to reduce the size of fragments prior to their transmission to the join site.
Sign-in/Register to access full text options 
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.
