Abstract
In a distributed relational database, an operation that produces the union of fragments stored at different sites at a specified site is called a distributed union operation. In implementing the distributed union operation, operations other than the union operation, such as intersection and difference, may be used to facilitate the union. Optimization of the distributed union operation when the fragments are not disjoint requires the ability to predict the size of the result of set operations. A minimal basis of the result of multiple non-disjoint horizontal fragments of a relation is derived. This is used to develop a model for the optimization of the distributed union operation. As the problem is NP Hard, heuristic and lower bounding procedures are developed for a special case.Request access from your librarian to read this article's full text.
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.
