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

Explain the paths in the association network, Explain the paths in the asso...

Explain the paths in the association network We can analyze use of paths in the association network as given below: Calculate each operation Find associations whic

Explain the benefit of oom, Explain the benefit of OOM. Main benefits o...

Explain the benefit of OOM. Main benefits of object oriented modeling are development of system become fast, quality of the system get improve. It gives freedom of use of alrea

Partial relation emp-get the details people with min salary, Let consider t...

Let consider the given partial relation EMP. Let us make some sub-queries for them EMPNO ENAME JOB SAL DEPTNO 7566

multiple-mode locks, Multiple-mode locks : It offers two locks: exclusive ...

Multiple-mode locks : It offers two locks: exclusive locks and shared locks. But why do we require these two locks? There are a lot of transactions in the database system that neve

Types of indexes, Types Of Indexes One of the words used during the fil...

Types Of Indexes One of the words used during the file organisation is the term index. In this part, let us describe this term in more detail. We find the index of keywords

Short note on mid square method of hashing, Short Note on mid Square Method...

Short Note on mid Square Method of hashing? Mid square method of hashing: In the method midsquare hashing, the key is squared and the address selected from the center of the s

Describe domain constraints, Describe domain constraints. Domain constr...

Describe domain constraints. Domain constraints contain entity integrity and referential integrity. The domain is a set of values that might be assigned to an attribute. The en

Briefly describe concurrency execution, Briefly describe concurrency execut...

Briefly describe concurrency execution? Lock - based protocols Locks There are several modes in which a data item may be locked in this section we restrict our attention

E-r model uses this symbol to represent weak entity set, E-R model uses thi...

E-R model uses this symbol to represent weak entity set ? A Doubly outlined rectangle symbol is used to represent weak entity set.

Illustrate the diagram - association as a cache, Association as a cache ...

Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient.    Figure:

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