Tuples-attributes , Database Management System

Assignment Help:

Consider a relation s over the attributes A and B with the following characteristics:

  • 5,000 tuples with 10 tuples per page
  • A 2-level B+ tree index on attribute A with up to 100 index entries per page
  • Attribute A is a candidate key of s
  • The values that the attribute A takes in relation s are uniformly distributed in the range 1to 100,000.

(a)    Assuming that the aforesaid index on A is unclustered, estimate the number of disk accesses needed to compute the range query σA>1000 ^ A<6000 (s).

(b)   What would be the cost if the above index were clustered? Explain your reasoning.

 


Related Discussions:- Tuples-attributes

What are segments in oracle, What are segments in oracle? Segments - Ea...

What are segments in oracle? Segments - Each table has single field of disk space, known as segment, set aside for it in the tablespace. Segments consist of contiguous sections

Relational algebra operators, Question 1 Draw a Data Flow Diagram for a...

Question 1 Draw a Data Flow Diagram for a University scenario Question 2 Discuss the following with suitable examples Relational Algebra Operators Database Pla

OLD HOME POLICIES, Write an sql statement to find what is the percentage of...

Write an sql statement to find what is the percentage of home policies which are from the state of Arizona out of all Home policies by Policy Value.

Explain the exec statement in sql, Explain the EXEC statement in SQL  A...

Explain the EXEC statement in SQL  Ans: All statements which start with EXEC SQL are embedded SQL database statements. High level languages such as C can be employed to write a

What are the three data anomalies, What are the three data anomalies that a...

What are the three data anomalies that are likely to occur as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why not? A

File organization, what is file organization? what are file organization te...

what is file organization? what are file organization techniques.explain in detail? explain random file organization technique, multikey file organization technique?what is indexin

HIT, Meaningful use refers to the use of certified EHR technology to "enhan...

Meaningful use refers to the use of certified EHR technology to "enhance quality, efficiency, and reduce health disparities

Define atom of domain relational calculus, Define Atom of domain relational...

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Define partial, Partial Key : It is a group of attributes that can uniquel...

Partial Key : It is a group of attributes that can uniquely identify small entities and that are related to same base entity. It is sometime named as Discriminator.  Altern

Use the relational algebra to formulate query, Consider the following datab...

Consider the following database schema: STAFF(StaffNo, fName, lName, Position, sex, dob, branchNo) BRANCH(BranchNo, Street, City) Assume the following for the above database

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd