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

Ways to suggest the dba, a)  Suppose we updated the catalog tables in real ...

a)  Suppose we updated the catalog tables in real time, that is, after every update, insert, or delete SQL statement were executed-rather than only running RUNSTATS once every few

Three levels of ANSI-SPARC architecture, a need some real life examples of...

a need some real life examples of database management systems three level of ANSI SPARC architecture life teacher and student ,company and employee or for NGO etc.

Draw an e-r diagram and convert it to a relational schema, In an organisati...

In an organisation various projects are undertaken. Each projects can employ one or more employees. Every employee can work on one or more projects. Each project is undertaken on

Write query to insert data in student table, Consider student (std_id, std_...

Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328

Method of analyzing association traversal, Analyzing Association Traversal ...

Analyzing Association Traversal Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application,

Relation instance or relation state, A relation instance indicates as r is ...

A relation instance indicates as r is a collection of tuples for a given relational schema at a exact point of time. A relation state r of the relation schema R (A 1 ,A 2 ,.....

Define two-phase locking protocol, Define two-phase locking protocol. A...

Define two-phase locking protocol. Ans: Two-phase locking is significance in the context of ensuring that schedules are serializable. The two-phase locking protocol defines a p

What is meant by data-transfer rate, What is meant by data-transfer rate? ...

What is meant by data-transfer rate? The data-transfer rate is the rate at which data can be retrieved from or kept to the disk.

Explain the deferred update, Explain the Deferred Update The deferred ...

Explain the Deferred Update The deferred update methods do not physically update the database on disk till after a transaction reaches its commit point; after that the updates

Process-oriented decompositions, Process-oriented decompositions Pr...

Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal

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