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 the concept of deadlock, Question: In a multi-user database env...

Question: In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also le

Project on designing and creating a database , This project will involve de...

This project will involve designing and creating a database for an organization.  In the design of a database, there is no single "perfect" design.  So your database design may not

State the objectives of object design, Determine the OBJECTIVES of  object ...

Determine the OBJECTIVES of  object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl

Fire department, The State of Newyork certifies firefighters throughout sta...

The State of Newyork certifies firefighters throughout state keep track all of them, as well as the state’s of fire departments. Each fire department has unique department number

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

Why do you go for sorting your query results, Why do you go for sorting you...

Why do you go for sorting your query results? SQL SELECT command to fetch data from MySQL table. Whenever you select rows, the MySQL server is free to return them in any order

Physical dbms architecture, PHYSICAL DBMS ARCHITECTURE  The physical ...

PHYSICAL DBMS ARCHITECTURE  The physical architecture defines the software components used to process and enter data, and how these software components are related and interc

Wait-die scheme -deadlock prevention, Wait-die" scheme : The idea is based ...

Wait-die" scheme : The idea is based on non-preventive method. It is based on a simple rule:                                 If Ti requests a database resource that is held by T

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.

In case of entity integrity the primary key may be declared, In case of ent...

In case of entity integrity, the primary key may be declared? In a case of entity integrity primary key may be not Null.

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