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

What subschema expresses, What subschema expresses ? A subschema expres...

What subschema expresses ? A subschema expresses the external view. (External schemas are called also called as subschemas)

Access, I have to solve a problem using access

I have to solve a problem using access

Describe second normal and third normal form, Database Management Systems ...

Database Management Systems 1. Explain SQL Server 2000 Architecture with diagram. 2. Describe Second Normal and Third Normal Form. 3. Explain about query engine and stora

Explain weak and strong entity sets, Explain weak and strong entity sets? ...

Explain weak and strong entity sets? Weak and Strong entity sets: A physically powerful entity set has a primary key. All tuples in the group are distinguishable through that k

Explain authorization and integrity manager, Explain Authorization and Inte...

Explain Authorization and Integrity Manager ? Authorization and Integrity Manager: Tests for the satisfaction of integrity constraints and checks the authority of users to acce

Extended star schema model, A customer places orders for parts and belongs ...

A customer places orders for parts and belongs to a particular industry group. An individual order is taken by a particular sales representative on a specific date and the sales re

Get details of employee working on both comp354 and comp345, Consider the r...

Consider the relations EMPLOYEE(emp#, name) ASSIGNED_TO(project#, emp#) PROJECT(project#, project_name, chief) Express the subsequent queries in Relational Algebra (i) Ge

What are the advantages of having an index structure, What are the advantag...

What are the advantages of having an index structure?      Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco

Update operations in dbms - insert operation, Update Operations and Dealing...

Update Operations and Dealing with Constraint Violations There are three basic operations to be executes on relations: Insertion Deletion Update The INSER

Explain the static or conservative two phase locking, Explain the Static or...

Explain the Static or conservative Two Phase Locking: Static (or conservative) Two Phase Locking: In this type of scheme, all the data items are locked earlier than any opera

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