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

RDBMS, DISADVANTAGES OF RDBMS

DISADVANTAGES OF RDBMS

Write short notes on relational constraints, Write short notes on relationa...

Write short notes on relational constraints? Relational Constraints are: 1. NOT NULL 2. Unique 3. Primary key 4. Foreign key 5. Table check

Er diagrams, in an organization several projects are undertaken. Each proje...

in an organization several projects are undertaken. Each project can employ one or more employees. Each employee can work on one or more projects. Each project is undertaken on the

Create a view containing name and number of department, Create a view emp_d...

Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep

Explain displaying an er schema as an er diagram, Explain the conventions f...

Explain the conventions for displaying an ER schema as an ER diagram? An E-R Diagram scheme might describe certain constraints to that the contents of a database must conform.

Write short notes on domain relational calculus, Write short notes on domai...

Write short notes on domain relational calculus   The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole

Define partial key and primary key, Define Partial Key and Primary Key ...

Define Partial Key and Primary Key A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar o

What is message switching, What is Message switching Message switching ...

What is Message switching Message switching transmits data units which can be arbitrarily long. Packet switching has a utmost packet size, if any message longer than that, it s

Explain the need of parallel database, Probelm: a) In the context of OO...

Probelm: a) In the context of OODBMS, define the following terms with appropriate examples. (i) Object class. (ii) Abstract class. (iii) Aggregation. (iv)

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