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

Create database for car application, The Database MySQL scripts cars_f...

The Database MySQL scripts cars_for_sale.sql and car_details.sql containing the data to use for this task have been supplied. To complete this task, you need to first create

Finkelstein methodology, PART MARKING: For this section, we will use part m...

PART MARKING: For this section, we will use part marking. This means we will supply model answers to all questions but we will only mark six questions. We will choose these randoml

Clustering indexes, Clustering Indexes It may be an excellent idea to k...

Clustering Indexes It may be an excellent idea to keep data of the students in the order of the programme they have registered as most of the data file accesses may need studen

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

Windows 8 Administrative Tools, Which two tools are used to administer user...

Which two tools are used to administer users for Active Directory?

Define the two phase locking protocol, Define the Two Phase Locking Protoco...

Define the Two Phase Locking Protocol This is a protocol that is used to make sure serializability of transactions. This protocol needs that every transaction issue lock and u

Define serializable schedule, Define Serializable schedule Serializable...

Define Serializable schedule Serializable schedule: An interleaved schedule of much more than one transaction is known as a serializable schedule, if it is equal to some serial

What is an index, What is an Index? An index is a small table having on...

What is an Index? An index is a small table having only two columns. The first column has a copy of the primary or candidate key of a table and the second column having a set o

ER diegrams, How to draw an ER diagram to a finance companz

How to draw an ER diagram to a finance companz

Operator precedence-data manipulation language, Operator Precedence The...

Operator Precedence The basic operators used in SQL are * /   - + Operators of the similar priority are evaluated From Left to right Parentheses are used to force priorit

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