Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

A) You are implementing a Relational Database for a company t that sells its pro

ID: 3839850 • Letter: A

Question

A) You are implementing a Relational Database for a company t that sells its products on internet. The Database maintains the Customer information in a table called “CUSTOMERS”. The primary key of this table is a column called “CustomerID”. There are also columns “LastName”, “FirstName” , “City” , and “ZipCode” representing last name, first name, city in which the Customer lives and the 5 digit zip code of the customer respectively. When a customer calls the customer service department with any inquiries, the customer service representative asks the customer for his or her Customer ID and pulls the information related to that customer from the Database. However, if a caller does not remember his/her Customer ID, the Customer service representative asks the customer for his/her last name and the 5 digit zip code, pulls the information related to all the customers from the database with matching last name & zip code combination and then further narrows down the search for the customer record based on some other identifiable information about the customer. The CUSTOMER table is expected to have millions of records and the system needs to quickly retrieve a set of matching customer records based on Customer’s last name and 5 digit zip code combinations. As the Database Designer, how could you speed up the retrieval of data from the CUSTOMER table for a given combination of customer’s last name and zip code?

My question is that is it right to create an andex on both both last name and zip code column or create an index of each family name and code column? It must be a non clustered index? Thank you very much.

How about the other questions below?

B) You are implementing a NoSQL database to record the grievances of customers of an automobile company. You have freedom of recommending a Key-Value type database or a Document Database. Each of the grievance record is keyed on Customer ID, and contains certain other information like the Automobile model (examples: Camry, Civic, Corolla, Escort….), grievance category (Example: Mileage/Fuel consumption, Maintenance costs, pickup time…), and some description of the grievance. The system needs an ability to index and query the grievance records based on values for Automobile model and grievance category. As the Database Designer, would you recommend a Key-value type of database or a Document database? Please provide explanation(s) for your recommendation.

C) You are tasked with implementing a NoSQL database for a Social Network website. The website has a requirement to identify common friends/connections between given two members. You have freedom to recommend a key-value type database, Document database or a Graph database. Which type of Database would you recommend for this type of application?

Explanation / Answer

A. We create index on table column to speed up search. We need to add index on column which frequently used in where condition in out search query.If we create more index in table then more overhead will occur at the time of table altertion.If we use composite index then it will speed up the query and increse the perforance. So we should use composite key index on both zip code and last name.

B. We should use key value as Key can be customer ID which is unique in our record and value will be information about particular customer.So I should prefer customer.

C. We should use Graph database for this as In graph we can show a connected path(edge between two vertex v1,v2) if v1 and v2 is friend to each other. So graph will very easy to show friendship between users.

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote