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

In which format database schema is written, In which format database schema...

In which format database schema is written ? Data base schema is written in the DDL format.

What do you mean by atomicity and aggregation, What do you mean by atomicit...

What do you mean by atomicity and aggregation? Atomicity : Either all actions are carried out or none are. Users should not have to worry about the effect of incomplete trans

Explain two phase locking protocol, Explain Two phase locking protocol ...

Explain Two phase locking protocol A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the tra

How many types of users works on database, How many types of users works on...

How many types of users works on database? Users are differentiated through the way they expect to interact along with the system (i) Application programmers-interact with

Distributed query and transaction processing, Distributed query and transac...

Distributed query and transaction processing a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4

Case study, what problems are raised by the database? why is it so controve...

what problems are raised by the database? why is it so controversial? why is data quality an issue?

E-R MODEL, WHAT IS MEANT BY E-R MODEL

WHAT IS MEANT BY E-R MODEL

Define the term- having clause and a where clause, What is the difference ...

What is the difference between a HAVING CLAUSE and a WHERE CLAUSE? HAVING CLAUSE - HAVING CLAUSE is used only with SELECT statement. - It is normally used in a GROUP BY

Aggregation, Aggregation : One limitation of the E-R diagram is that they d...

Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent

Give an example of operations from the functions of a bank, Give an example...

Give an example of Operations from the functions of a bank. For creation of a saving account, you can write: bank::: create -savings-account (customer)->account. For oper

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