
Concept explainers
Explanation of Solution
a. Recommendations of required
Recommendations make regarding the type and characteristics of the required data base system are as follows:
- • The magazine publishing organization wants a distributed system with distributed database capabilities.
- • The distributed system will be distributed among the organization locations in Tennessee, South Carolina, Florida, and Georgia.
- • The distributed transparency features such as transaction transparency, fragmentation transparency, performance transparency, and replica transparency are supported by the Distributed Database Management System (DDBMS).
- • Heterogeneous competency is not a compulsory feature since the customers assume there is no existing Database Management System (DBMS) in place and that the organizations needs to normalize on a single DBMS.
Explanation of Solution
b. Data fragmentation needed for tables:
The data fragmentation needed for “CUSTOMER”, and “INVOICE” table is as follows:
The database is horizontally partitioned using the “REGION” attribute for the “INVOICE” table and the “STATE” attribute for the “CUSTOMER” table.
Explanation of Solution
c. Criteria used to partition the database:
The criteria “horizontal fragmentation” is used to partition the database.
Horizontal fragmentation of the “INVOICE” table by region is as follows:
Fragment name | Location | Condition | Node name |
I1 | Tennessee | REGION_CODE = “TN” | NAS |
I2 | Georgia | REGION_CODE = “GA” | ATL |
I3 | Florida | REGION_CODE = “FL” | TAM |
I4 | South Carolina | REGION_CODE = “SC” | CHA |
Horizontal fragmentation of the “CUSTOMER” table by state is as follows:
Fragment name | Location | Condition | Node name |
C1 | Tennessee | REGION_CODE = “TN” | NAS |
C2 | Georgia | REGION_CODE = “GA” | ATL |
C3 | Florida | REGION_CODE = “FL” | TAM |
C4 | South Carolina | REGION_CODE = “SC” | CHA |
Explanation of Solution
d. Database fragments:
Following are the database fragments with node names, location, fragment names, attribute names, and demonstration data.
Fragmentation of “INVOICE” table:
Fragment “I1” of “INVOICE” table with location “Tennessee”, and node “NAS” is as follows:
INV_NUM | REGION_CODE | CUS_NUM | INC_DATE | INV_TOT |
213342 | TN | 10884 | 1-NOV-15 | 45.95 |
209987 | TN | 10993 | 15-FEB-16 | 45.95 |
Fragment “I2” of “INVOICE” table with location “Georgia”, and node “ATL” is as follows:
INV_NUM | REGION_CODE | CUS_NUM | INC_DATE | INV_TOT |
198893 | GA | 11887 | 15-AUG-15 | 70.45 |
224345 | GA | 13558 | 1-JUN-16 | 45.95 |
Fragment “I3” of “INVOICE” table with location “Florida”, and node “TAM” is as follows:
INV_NUM | REGION_CODE | CUS_NUM | INC_DATE | INV_TOT |
200915 | FL | 10014 | 1-NOV-15 | 45.95 |
231148 | FL | 15998 | 1-MAR-16 | 24.95 |
Fragment “I4” of “INVOICE” table with location “South Carolina”, and node “CHA” is as follows:
INV_NUM | REGION_CODE | CUS_NUM | INC_DATE | INV_TOT |
243312 | SC | 21562 | 15-NOV-15 | 45.95 |
231156 | SC | 18776 | 1-OCT-16 | 45.95 |
Fragmentation of “CUSTOMER” table:
Fragment “C1” of “CUSTOMER” table with location “Tennessee”, and node “NAS” is as follows:
CUS_NUM | CUS_NAME | CUS_ADDRESS | CUS_CITY | CUS_STATE | CUS_SUB_DATE |
10884 | James D.Burger | 123 Court Avenue | Menphis | NV | 8-DEC-16 |
10993 | Lisa B.Barnette | 910 Eagle Street | Nashville | NV | 12-MAR-17 |
Fragment “C2” of “CUSTOMER” table with location “Georgia”, and node “ATL” is as follows:
CUS_NUM | CUS_NAME | CUS_ADDRESS | CUS_CITY | CUS_STATE | CUS_SUB_DATE |
11887 | Ginny E.Statton | 335 Main street | Atlanta | GA | 11-AUG-16 |
10993 | Anna H.Ariona | 657 Mason Ave. | Dalton | GA | 23-JUN-17 |
Fragment “C3” of “CUSTOMER” table with location “Florida”, and node “TAM” is as follows:
CUS_NUM | CUS_NAME | CUS_ADDRESS | CUS_CITY | CUS_STATE | CUS_SUB_DATE |
10014 | John T.Chi | 456 Brent Avenue | Miami | FL | 18-NOV-16 |
15998 | Lisa B.Barnette | 234 Ramala Street | Tampa | FL | 23-MAR-17 |
Fragment “C4” of “CUSTOMER” table with location “South Carolina”, and node “CHA” is as follows:
CUS_NUM | CUS_NAME | CUS_ADDRESS | CUS_CITY | CUS_STATE | CUS_SUB_DATE |
21562 | Thomas F.Matto | 45 N.Pratt Circle | Charleston | SC | 2-DEC-16 |
18776 | Mary B.Smith | 526 Boone Pike | Charleston | SC | 28-OCT-17 |
Explanation of Solution
e. Distributed database operations supported at each remote site:
The following table show the map of the location, the fragments at each location, and the type of transaction or request support to need to access the data in the distributed database.
Fragment | NAS | ATL | TAM | CHA |
INVOICE | I1 | I2 | I3 | I4 |
CUSTOMER | C1 | C2 | C3 | C4 |
Distributed operations required | None | None | None | None |
From the above table, there is no interstate access of “INVOICE” or “CUSTOMER” data is required. Therefore, there is no distributed database access is required in the four nodes such as “NAS”, “ATL”, “TAM”, and “CHA”.
Explanation of Solution
f. Distributed database operations supported at headquarters site
The following table show the map of the location, the fragments at each location, and the type of transaction or request support to need to access the data in the distributed database.
Fragment | NAS | ATL | TAM | CHA | Headquarters |
INVOICE | I1 | I2 | I3 | I4 | |
CUSTOMER | C1 | C2 | C3 | C4 | |
Distributed operations required | None | None | None | None | Distributed request |
For the headquarters, the manager needs to able to access the data in all four nodes such through a single SQL request. Therefore, the Distributed Database Management System (DDMS) must support distributed requests.
Want to see more full solutions like this?
Chapter 12 Solutions
EBK DATABASE SYSTEMS: DESIGN, IMPLEMENT
- For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.arrow_forwardMaximum Independent Set problem is known to be NP-Complete. Suppose we have a graph G in which the maximum degree of each node is some constant c. Then, is the following greedy algorithm guaranteed to find an independent set whose size is within a constant factor of the optimal? 1) Initialize S = empty 2) Arbitrarily pick a vertex v, add v to S delete v and its neighbors from G 3) Repeat step 2 until G is empty Return S Yes Noarrow_forwardPlease help me answer this coding question in the images below for me(it is not a graded question):write the code using python and also provide the outputs requiredarrow_forward
- What does the reduction showing Vertex Cover (VC) is NP-Complete do: Transforms any instance of VC to an instance of 3SAT Transforms any instance of 3SAT to an instance of VC Transforms any instance of VC to an instance of 3SAT AND transforms any instance of 3SAT to an instance of VC none of the abovearrow_forwardPlease assist me by writing out the code with its output (in python) using the information provided in the 2 images below.for the IP Address, it has been changed to: 172.21.5.204the serve code has not been open yet though but the ouput must be something along these lines(using command prompt):c:\Users\japha\Desktop>python "Sbongakonke.py"Enter the server IP address (127.0.0.1 or 172.21.5.199): 172.21.5.204Enter your student number: 4125035Connected to server!It's your turn to pour! Enter the amount to your pour (in mL):Please work it out until it gets the correct outputsNB: THIS QUESTION IS NOT A GRADED QUESTIONarrow_forwardneed help with a html code and css code that will match this image.arrow_forward
- need help with a html code and css code that will match this image. Part B - A Navigation Part B is the navigation component of a page. Information you need includes: Color Codes: Visiting links: #ff6666 Unvisited links: #ccff66 Hovered links: white Search box: #2ec4b6 rebeccapurple white Font: Google Font (Roboto) Icons: Font Awesome (fa-quidditch, fa-search) This is a flexbox based navigation menu. Other then padding, all spacing/positioning should be controlled using flex properties. The home link in the nav should point to your assignment file (to triggers visited styling). In the "state" screenshot below, Home is visited, Services is hovered (the mouse doesn't show up in the screenshot) and Products is unvisited.arrow_forwardMGMT SS STATS, an umbrella body that facilitates and serves various Social Security Organizations/Departments within the Caribbean territories, stood poised to meet the needs of its stakeholders by launching an online database. The database will provide members and the public access to the complete set of services that can (also) be initiated face-to-face, and it will provide managed, private, secure access to a repository of public and/or personal information. Ideally, the database will have basic details of pension plans recorded in the registry, member plan statistics, and cash inflows and outflows from pension funds.For example, insured persons accumulate contributions. Records for these persons will include information on the insured persons able to acquire various benefits once work is interrupted due to sickness, death, retirement, and maternity or employment injury. They will also include information on pensions such as invalidity, disability, and survivors that stem from one…arrow_forwardWhy all appvif i want to sign in its required phone number why not using google or apple its make me frustratedarrow_forward
- Why is the accuracy of time important in data visualizations? Detail a scenario from your professional experience in which time was structured poorly in a data visualization. How did this affect the understanding of the data presented? How do you think this error or oversight occurred?arrow_forwardWrite the KeanStudent class. The UML diagram of the class is represented below: KeanStudent - fullName: String - keanID: int -keanEmailAddress: String cellPhoneNumber: String + numberOfStudent: int + KeanStudent() + KeanStudent(fullName: String, keanID: int, keanEmailAddress: String, cellPhoneNumber: String) +getFullName(): String +setFullName(newFullName: String): void +getKeanIDO): int +getKeanEmailAddress(): String +getCellPhoneNumber(): String + setCellPhoneNumber(newCellPhoneNumber: String): void +toString(): String 1. Implement the KeanStudent class strictly according to its UML one-to-one (do not include anything extra, do not miss any data fields or methods) 2. Implement a StudentTest class to test the class KeanStudent you just created. • Create two KeanStudent objects using a no-args constructor and one from the constructor with all fields. o Print the contents of both objects. 。 Print numberOfStudent. 3. Add comments to your program (mark where data fields, constructors,…arrow_forwardMGMT SS STATS, an umbrella body that facilitates and serves various Social SecurityOrganizations/Departments within the Caribbean territories, stoodpoised to meet the needs of its stakeholders by launching an onlinedatabase at www.SSDCI.gov. The database will provide membersand the public access to the complete set of services that can (also)be initiated face-to-face, and it will provide managed, private, secure access to a repository ofpublic and/or personal information. Ideally, the database will have basic details of pensionplans recorded in the registry, member plan statistics, and cash inflows and outflows frompension funds.For example, insured persons accumulate contributions. Records for these persons will includeinformation on the insured persons able to acquire various benefits once work is interrupteddue to sickness, death, retirement, and maternity or employment injury. They will also includeinformation on pensions such as invalidity, disability, and survivors that stem from…arrow_forward
- Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningFundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781285196145Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos CoronelPublisher:Cengage LearningDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781305627482Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning





