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

What are the purpose for having variable length records, What are the purpo...

What are the purpose for having variable length records? What kinds of separator characters are required for each? Variable-Length Records - Variable-length records are thos

Explain the term- collation, What is Collation Collation is a kind of ...

What is Collation Collation is a kind of sort order. There are majorly 3 types of sort orders, namely: i.) Dictionary case insensitive ii.)Dictionary - case sensitive

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Attribute preservation, Attribute Preservation This is a easy and obvio...

Attribute Preservation This is a easy and obvious necessity that includes preserving all the attributes that were there in the relation that is being decomposed.

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

What are the disadvantages of relational approach, What are the disadvantag...

What are the disadvantages of relational approach? Disadvantages of relational approach: • Substantial hardware and system software overhead • May not fit all business models •

Explain network model in dbms, Explain Network Model in DBMS? Network ...

Explain Network Model in DBMS? Network Model - It was formalised within the late year of 1960s through the Database Task Group of the Conference on Data System Language (DBTG

Explain the functions and components of ddbms, Question 1 Explain the conc...

Question 1 Explain the concept of database recovery management. Explain the different levels of backup used for recovering data Question 2 What are the different types of par

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