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

Er database theoretical and modeling database system, Need an expert in ER ...

Need an expert in ER database theoretical and modeling database system Project Description: Need an expert in ER database theoretical and modeling database systems? Skills

In how many parts events are classified, In how many parts events are class...

In how many parts events are classified Events are classified as four types in UML 1.  Signals 2.  Calls 3.  Passing of Time 4.  Change in State

List the table modification commands in sql, List the table modification co...

List the table modification commands in SQL? A) Deletion B) Updates C) Insertion D) Update of a view

What are the advantages of logical databases, What are the advantages of Lo...

What are the advantages of Logical Databases? It offers a simple-to-use selection screens.  You can change the pre-generated selection screen to your needs.  It offers check f

Eer diagram, Design an EER schema for the following application and transla...

Design an EER schema for the following application and translate the EER schema into relational schemas (and constraints). It is possible that some requirements cannot be captured

Spanned and unspanned organisation, Spanned and unspanned organisation? ...

Spanned and unspanned organisation? Spanned and unspanned organization: If records are not permited to cross block boundaries then the organisation is called unspanned record

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Which model is record based logical model, Which model is record based logi...

Which model is record based logical model? Network Modelis basically known as record based logical model.

Describe the basic steps involved in recovery, Question: One of the tas...

Question: One of the tasks a database management system must perform is to ensure that the data is still intact in the face of software and hardware failure. This task is known

Illustrate the definition of the classes and operation, The definition of t...

The definition of the classes and operation can often be adjusted to increase the amount of inheritance". Justify the above statement.   Adjustment of Inheritance The def

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