Popular Posts
-
Introduction of Indexing The main goal of designing the database is faster access to any data in the database and quicker insert/delete/...
-
Boyce-Codd Normal Form (3.5NF) This normal form is also referred as 3.5 normal forms. This normal form Meets all the requirement of 3N... -
Concurrency Control As we have seen above, when there are multiple transactions executing at the same time on same data, it may affect t... -
Introduction As we have already seen in previous articles that B+ tree is a (key, value) storage method in a tree like structure. B+ tre...
-
Introduction We have seen what ER diagram is and what its basic concepts are. Now let us see how to draw the ER diagram using these conc...
-
B+ Tree File Organization B+ Tree is an advanced method of ISAM file organization. It uses the same concept of key-index, but in a tre...
-
Relational Calculus Relational calculus is a non procedural query language. It uses mathematical predicate calculus instead of algebra. ...
-
Indexed Sequential Access Method (ISAM) This is an advanced sequential file organization method. Here records are stored in order of pri...
-
Deadlock Suppose we are executing a set of transactions in the database. Let us assume the transaction as updating the address of an empl...
-
Fifth Normal Form (5NF) A database is said to be in 5NF, if and only if, It's in 4NF If we can decompose table further to elimina...
