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

Explain the two types of participation constraint, Explain the two types of...

Explain the two types of participation constraint.  Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

Create student db and perform delete operation, Create Student DB and perfo...

Create Student DB and perform delete operation? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, co

What is trigger, What is trigger Triggers are statements that are imple...

What is trigger Triggers are statements that are implemented automatically by the system as the side effect of a change to the database.

Describe substring comparison in sql, Describe substring comparison in SQL....

Describe substring comparison in SQL. For the relation Person (name, address), write a SQL query that retrieves the names of people whose name starts along with ‘A' and address co

Determine the advanced modeling concepts, Determine the Advanced modeling c...

Determine the Advanced modeling concepts You have to follow some steps for object-oriented design. These steps for OO Design methodology are as follow:  1)  Produce objec

Explain traditional programming languages, How persistent programming langu...

How persistent programming languages differ from traditional programming languages? Database languages vary from traditional programming languages in that they directly manipul

Describe the storage structure of indexed sequential file, Describe the sto...

Describe the storage structure of indexed sequential files and their access method. Ans: Index offers a lookup capability to rapidly reach the vicinity of the desired record.

Data redundancy, Data Redundancy -A lot of information is being repeated in...

Data Redundancy -A lot of information is being repeated in the relation. For instance, the information that MCS-014 is named SSAD is repetitive, address of Rahul is "D- 27, Main ro

Lack of standards and experience, Lack of standards and experience: The la...

Lack of standards and experience: The lack of standards has considerably limited the potential of distributed DBMSs. As well, there are no tools or methodologies to help users cha

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