Abstract
In this paper we propose a database partitioning method that provides efficient response times for distributed web services transaction executions. Our partitioning and allocation approach aims at finding the optimal response time by reducing the cost of distributed data accesses, the cost of data replication, and using parallel execution as a cost-savings technique. We also seek to make the strategy work with dynamic workloads and distributed environments. For this, we develop a framework with a three-phased approach, which we outline in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.