Abstract
This paper analyzes a problem that occurs in distributed database systems. The problem is how to minimize the communication cost incurred by inter-site data transfers that are associated with on-line retrieval requests. A mathematical model of the problem is developed and results in an NP-Complete integer linear program. A lower bounding procedure, based on a Lagrangean relaxation and sub-gradient optimization, is devised and heuristic procedures are proposed. The results of computational experiments reveal good performance of the heuristic procedures.
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.
