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

Parallelism of transaction execution-data fragmentation, Parallelism of tra...

Parallelism of transaction execution: A transaction can be divided into various sub-queries that can operate on fragments in parallel. This enhances the degree of concurrency in t

1) Information about a bank is about customer, 1) Information a...

1) Information about a bank is about customers and their account. Customer has a name, address which consists of house number, area and city, and one or more phone numbers. Ac

The concurrent transactions, The Concurrent Transactions  Almost every ...

The Concurrent Transactions  Almost every commercial DBMS support multi-user environment. Therefore, allowing multiple transactions to proceed concurrently. The DBMS must make

Define the term- making common behaviour abstract, Making Common Behaviour ...

Making Common Behaviour Abstract Let us define abstraction "Abstraction means to focus on the necessary, inherent aspects of an entity and ignoring its accidental features". O

Give expression in both tuple calculus and domain calculus, Consider the fo...

Consider the following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for

Describe the nested-loop join and block-nested loop join, Describe the nest...

Describe the nested-loop join and block-nested loop join.   Ans:   The block nested- loop join algorithm is as described below:     for every block B r of relation R do beg

State the process of inheritance adjustment, Inheritance Adjustment As...

Inheritance Adjustment As in object oriented analysis and design terms inheritance defines a relationship between classes, where as one class shares structure or behaviour def

Draw the dependency diagram for the relation, Consider the subsequent relat...

Consider the subsequent relation   Professor (Pfcode, dept, head, time)   It is assumed that      (i) A professor can work in much more than one

desirable properties of decomposition, Desirable Properties Of Decompositi...

Desirable Properties Of Decomposition Decomposition is a process of dividing a relation into its projections that will not be disjoint. Please remind the Relational projection

What are the objectives of object design, What are the Objectives of object...

What are the Objectives of object design After going through this unit, you could be able to: explain steps of object design; discuss algorithms that reduce costs;

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