Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization.

Learning Goal: I’m working on a databases discussion question and need an explanation and answer to help me learn.Q1 – Create B tree and B+ tree of degree 3 for the following sequence of keys. Show the structure in both cases after every insertion. 60, 41, 50, 76, 37, 39, 68, 49, 44Q2- A file has r=30,000 EMPLOYEE records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long.Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker.a) Calculate the record size R in bytes.b) Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization.c) Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr i.Q3- Assume the following below given tables and answer the questions.Teacher (teacher_ID, teacher_name, teacher_dept, teacher_salary)Teaches (teacher_ID, course_id, sec_id, semester, year)Course (course_id, course_title, dept_name, course_credits)a) Query 1: write a relational algebra query to find the names of all teachers in the IT department, along with the course titles of the courses that they teach.b) Query 2: write a relational algebra query to find the names of all instructors in the IT department who have taught a course in 2020, along with the titles of the courses that they taught.Q4- Consider the given schema and answer the questions.Q(a,b), R(b,c), S(b,d), T(b,e).a) For the following SQL query, give two equivalent logical plans in relational algebra such that one is likely to be more efficient than the other. Indicate which one is likely to be more efficient. Explain.SELECT Q. aFROM Q, RWHERE Q.b = R.b AND R.c = 3b) By using the left-deep tree plan favored by optimizers. Write a left-deep tree plan for the below given SQL query. Use relational algebra; be sure to use parentheses to indicate the order that the joins should be performed.SELECT *FROM Q, R, S, TWHERE Q.b = R.b AND R.b = S.b AND S.b = T.b
Requirements: before 14/2/2022

Calculate your order
Pages (275 words)
Standard price: $0.00
Client Reviews
4.9
Sitejabber
4.6
Trustpilot
4.8
Our Guarantees
100% Confidentiality
Information about customers is confidential and never disclosed to third parties.
Original Writing
We complete all papers from scratch. You can get a plagiarism report.
Timely Delivery
No missed deadlines – 97% of assignments are completed in time.
Money Back
If you're confident that a writer didn't follow your order details, ask for a refund.

Calculate the price of your order

You will get a personal manager and a discount.
We'll send you the first draft for approval by at
Total price:
$0.00
Power up Your Academic Success with the
Team of Professionals. We’ve Got Your Back.
Power up Your Study Success with Experts We’ve Got Your Back.