Describe the algorithm for updating indices, Database Management System

Assignment Help:

Describe the algorithm for updating indices for a single level index when a record is 

  (i) Inserted  (ii)  deleted

What will be the modification if there are multilevel indices?    

Ans: Inserted: The time it acquires to insert a new data item.  This value involves the time it takes to find out the correct place to insert the new data item, also the time it takes to update the index structure.

Deleted: The time it receives to delete a data item.  This value involves the time it takes to find the item to be deleted, also the time it takes to update the index structure.


Related Discussions:- Describe the algorithm for updating indices

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

How to rearrange classes and operations, Rearrange Classes and Operations ...

Rearrange Classes and Operations Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often oper

Give concurrent sub states diagram for the classroom, Give Concurrent sub s...

Give Concurrent sub states diagram for the classroom and exam held. In Figure, simultaneous substrates have been taken. After passing Minor 1 test you could give Minor 2 test. T

Explain discretionary access control, Problem: (a) Given the following ...

Problem: (a) Given the following relation: Stats(Name,Sex,Children, Occupation, Salary, Tax, Audits) Write SQL code to define the following security constraints: (i) User

In which format database schema is written, In which format database schema...

In which format database schema is written ? Data base schema is written in the DDL format.

Compare wait-die deadlock prevention with wait-wound scheme, Compare wait-d...

Compare wait-die deadlock prevention scheme with wait-wound scheme   Ans:  Wait-Die Scheme  a) Based upon a nonpreemptive technique.  b) If Pi requests a resource present

What is theta join explain, What is theta join explain? Theta  Join  -...

What is theta join explain? Theta  Join  - The  theta  join  operation  is  an  extension  to  the  natural-join operation which permits us to merge selection and a Cartesian

Commercial database architecture, At its most essential level the DBMS arch...

At its most essential level the DBMS architecture can be divide into two parts: the back end and the front end. The back end is responsible for managing the physical database an

Explain concurrency control, Explain concurrency control? Concurrency ...

Explain concurrency control? Concurrency control Oracles multiversion concurrency control varies from the concurrency mechanism used by some other data base vendors. Read

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