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

Write a qbe query to display names of cs department, Consider a table stude...

Consider a table student (std_id, std_name, date_of_birth, percent_marks, dept_name). Write a QBE query to display names of Computer Science department students who have scored mo

Define 3nf normal form, 3NF Normal Form A relation schema R is in 3NF ...

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

Define database layer, Define Database layer? The database layer define...

Define Database layer? The database layer defines the data formats used in the database.

Write short notes on domain relational calculus, Write short notes on domai...

Write short notes on domain relational calculus The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole t

Decomposition, properties of derirable decomposition

properties of derirable decomposition

What are multiple inheritances, What are multiple inheritances? Multipl...

What are multiple inheritances? Multiple inheritances allow a class to inherit variables and methods from many super classes.

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Explain the term high level dml, Explain the term High level DML? High...

Explain the term High level DML? High level DML A high-level or non-procedural DML permit the user to specify what data is needed without specifying how it is to be acquired.

Use the relational algebra to formulate query, Consider the following datab...

Consider the following database schema: STAFF(StaffNo, fName, lName, Position, sex, dob, branchNo) BRANCH(BranchNo, Street, City) Assume the following for the above database

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