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

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

Data control, Data Control The data control mostly refers to commands that...

Data Control The data control mostly refers to commands that permit system and data privileges to be passed to several users. These commands are usually available to database admi

Explain the check clause, Explain the Check Clause The CHECK clause is ...

Explain the Check Clause The CHECK clause is employed to at the end of a CREATE TABLE statement specify table constraints. This is known as table-based constraint because it ap

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

What are the components of storage manager, What are the components of stor...

What are the components of storage manager? The storage manager components include a) Authorization and integrity manager b) Transaction manager c) Buffer manager d

Data Minnning, Can i get help with weka software

Can i get help with weka software

Decomposition properteis, what is lossless & dependency preserving decompo...

what is lossless & dependency preserving decomposition ?

State the technique of converting the state diagram to code, The technique ...

The technique of converting the state diagram to code a) Identify all major control paths. Start from initial state; choose a path across the diagram that corresponds to normal

Improve efficiency in query evaluation, Question: AirwaysCentre, an int...

Question: AirwaysCentre, an international airline booking company currently uses a relational database system for their operations, which includes the following relations: P

Optimistic concurrency control, Optimistic Concurrency Control Is locki...

Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency

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