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 deadlocks, What are deadlocks?  How can they be avoided?  Ans:...

What are deadlocks?  How can they be avoided?  Ans: Deadlock considers to a particular condition when two or more processes are every waiting for another to release a resource,

Draw the E/R diagrams, for the following business rules . Identify all enti...

for the following business rules . Identify all entities, attributes, relationships, primary keys, cardinalities and constraints where appropriate 3. (9) An art museum owns a larg

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

Characteristics, what are the main characteristics of database

what are the main characteristics of database

Create student db and retrieve all student name in cs, Create a Student dat...

Create a Student database and Retrieve the names of all students majoring in ‘CS' Consider the following relational database: STUDENT (name, student#, class, major) COURSE (co

Non-redundant cover and canonical cover, Given the following set of functio...

Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.

Assignment, how does Btree differ from a B+ - tree?

how does Btree differ from a B+ - tree?

What is a view, What is a view?  Make a view of EMP table named DEPT 20, to...

What is a view?  Make a view of EMP table named DEPT 20, to display the employees in department 20 and their annual salary.  Ans:  View is a virtual table that does not consist

Define redo logs, Redo Logs: Any database must have minimum two redo logs....

Redo Logs: Any database must have minimum two redo logs. These are the rules for the database; the redo logs record all modifies to the system objects or user objects. If any type

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