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

Remove all transitive dependencies - dependency diagram, 1. Use the Invoice...

1. Use the Invoice table structure shown below to answer the following questions: a)  Draw the dependency diagram and identify the primary key and all dependencies, including al

Log based recovery, under what condition log based recovery is feasible?

under what condition log based recovery is feasible?

How many types of locks are there, Depending upon the rules we have found, ...

Depending upon the rules we have found, we can classify the locks into two types. Shared Lock: A transaction might be acquiring shared lock on a data item in order to read it

Advantages to copying records from one table to another, What kind of advan...

What kind of advantages to copying records from one table to another? -) When an algorithm that modifies a table is used after that it's safer to work with the copy -) When

State the meaning of self-transition, What is self-transition? ...

What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f

Abstract data structures, The C_Artist  application will be developed using...

The C_Artist  application will be developed using the C language (C99 standards) and will be able to compile without warnings and link and run in the Swinburne computer laboratorie

What is a b+-tree index, What is a B+-Tree index? A B+-Tree index takes...

What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the

Data warehouse, 1) Define a job scheduling strategy that will meet business...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

Explain the structured decomposition, Differentiate between the object orie...

Differentiate between the object oriented decomposition and the structured decomposition? Process-oriented (structural) decomposition divides a complex process, function or tas

Explain transaction manager and their work, Explain Transaction manager and...

Explain Transaction manager and their work? Transaction Manager: Ensure the database remains in a constant (correct) state despite system failure, and in which concurrent trans

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