Answered: USE SIMPLE JAVA CODE PLEASE The…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Topic Video

Question

USE SIMPLE JAVA CODE PLEASE

The program will read and parameter file which defines necessary parameter to
decide how each fragment will be access in term of the expected cost of query and update, expected
probability of query and update to each fragment.

Your program should be able to find and print optimal allocation for each fragment and display the
overall cost of all possible replication as well. The optimal replication which is the lowest cost among all
should be also printed.

#Total number of fragment
3
#Expected cost of a remote query to fragment i.
1.0, 1.0, 1.3
#Expected cost of a remote update to fragment i.
1.2, 1.5, 2.0
#Number of sites
4
#Expected probability that fragment i is queried by site j.
1.0, 1.0, 0.4, 0.0
0.0, 0.4, 0.7, 1.0
0.0, 1.0, 1.0, 0.0
#Expected probability that fragment i is updated by site j.
0.6, 0.4, 0.0, 0.0
0.0, 0.0, 0.4, 0.6
0.0, 0.5, 0.5, 0.0

The sample partial output of the program
Number of sites: 4
Computing optimal allocation for fragment 0
x= [0, 0, 0, 0], exptected cost = 2.4
x = [1, 0, 0, 0]
x = [0, 1, 0, 0]
exptected cost = 1.88
exptected cost = 2.12
Fragment 0:
Optimal Replication = [1, 1, 0, 0], min Cost = 1.6

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions