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 a database schema, Consider a database schema consisting of four rel...

Consider a database schema consisting of four relations, whose schemas are: Product (maker, model, type) PC (model, speed, ram, hd, price) Laptop (model, speed, ram, hd, s

Differentiate between strict and rigorous two phase locking, Differentiate ...

Differentiate between strict two-phase and rigorous two-phase with conversion protocol Ans:  Strict two-phase locking holds all its exclusive that is write locks until commit t

Hashing techniques, folding method and mid square method using visual basic...

folding method and mid square method using visual basic

Explain the exists and unique functions of sql, Explain the EXISTS and UNIQ...

Explain the EXISTS and UNIQUE functions of SQL. Give an example for each? EXISTS: The EXISTS function takes one parameter that is a SQL statement. If any records exist which

Report writing help on database mgmt, Report writing help on database mgmt ...

Report writing help on database mgmt Project Description: Use of Harvard referencing, critical analysis is required. Skills required: Academic Writing, Technical Writin

Query optimization in database system, Problem : AirwaysCentre, an inte...

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

Enhanced entity relationship, what do you understand by enhanced entity-rel...

what do you understand by enhanced entity-relationship

Data analyzing and desing, Critically explained the benefits and limit...

Critically explained the benefits and limitations of different database technologies with proper examples

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Sorting field groups we cannot use more than one key field, While sorting f...

While sorting field groups we cannot use more than one key field False.

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