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

Explain i command in qbe, Explain I command in QBE ? I : It is the co...

Explain I command in QBE ? I : It is the command in QBE that is used to insert tuple (s) into the database

E r diagram, how to make an e r diagram?

how to make an e r diagram?

What is class diagram, Class Diagram A class diagram is required to su...

Class Diagram A class diagram is required to support functional necessity of system. In a static design view, class diagram is used to model vocabulary of the system, simple c

Accounting and external reporting, List the internal controls that should b...

List the internal controls that should be in effect solely because a EDP system is employed, classifing them as (1) Those controls pertaining to input of information and (2) All ot

What is mysql, What is MySQL? MySQL is a relational database management...

What is MySQL? MySQL is a relational database management system which has eleven million installations. It can be used for both Linux and Window. Managing database includes add

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

Explain the timestamps for read operations, Timestamps For Read operations:...

Timestamps For Read operations: If TS (T) If TS (T) >= W-timestamp (Q), then the transaction T is trying to read a value of data item Q which has been written and committed

What is hashing file organization, What is hashing file organization? ...

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

State the object design for processing, State the Object Design for Process...

State the Object Design for Processing  The object design phase comes after analysis and system design phase. The object design phase includes implementation details like as i

What are the three data anomalies, What are the three data anomalies that a...

What are the three data anomalies that are likely to occur as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why not? A

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