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

Discuss on transmission impairments, Question 1 Discuss on transmission im...

Question 1 Discuss on transmission impairments Question 2 What is framing? Question 3 Write a note on 10Base2 10Base- T Question 4 Explain the rev

What is system catalog or catalog relation, What is system catalog or catal...

What is system catalog or catalog relation? How is better known as? A RDBMS maintains a explanation of all the data that it contains, information about every relation and index

Main difference between read-only and update methods, What is the main diff...

What is the main difference between read-only and update methods? A read-only method does not affect the values of a variable in an object, whereas an update method may alter t

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

Explain weak and strong entity type ? Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a wea

What is data model, A Data Model in software engineering is an abstract...

A Data Model in software engineering is an abstract model that organizes and documents the business data for interaction between team members and is used as a plan for creating

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Draw and explain the three level architecture of database, Draw and explain...

Draw and explain the three level architecture of the database system? A DBMS gives three levels of data is said to follow three-level architecture. The trget of the three-schem

Describe the major steps in the implementation process, Question: (a) ...

Question: (a) One of the steps in the five-step problem-solving model is implementation. Implementation is considered a key step in the problem-solving model. A problem may be

Example of equijoin, Example: Consider the following relations: ...

Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

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