Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Bhanu Priya
Page 71 of 106
Explain schedules in 2PL with multiple granularities locking and schedules under tree(DBMS)
Locking and unlocking of the database should be done in such a way that there is no inconsistency, deadlock and no starvation.2PL locking protocolEvery transaction will lock and unlock the data item in two different phases.Growing Phase − All the locks are issued in this phase. No locks are released, after all changes to data-items are committed and then the second phase (shrinking phase) starts.Shrinking phase − No locks are issued in this phase, all the changes to data-items are noted (stored) and then locks are released.Consider a tree structure database as follows −A -> B -> CLet us now ...
Read MoreWhat is a materialized view in DBMS?
A materialized view is a view whose contents are computed and stored. Materialized view is also a logical virtual table, but in this case the result of the query is stored in the table or the disk. The performance of the materialized view is better than normal view since the data is stored in the disk.It's also called indexed views since the table created after the query is indexed and can be accessed faster and efficiently.ExampleConsider the view given below −Create view branchloan(branch-name, total-loan) as select branch-name , sum(amount) from loan groupby branch-name;Materializing the above view would be especially useful ...
Read MoreCheck the view serializability for the given schedules(DBMS)
A schedule has view-serializability if it is viewed as equivalent to a serial schedule. A schedule is view serializable if the following three rules are satisfied −Rule 1 − If Ti reads data initially, after this Tj writes the same data, in the given schedule. This sequence must be followed in the transaction combination (read write operation).Rule 2 − If Ti writes data initially, after this Tj reads the same data, in the given schedule. This sequence must be followed in the transaction combination (write read operation).Rule 3 − If Ti writes data, after this Tj writes the data finally. ...
Read MoreWhen do we say the schedule is conflict equivalent(DBMS)?
Two schedules are said to be conflict equivalent if the order of any two conflicting operations are the same in both the schedules.Also, a concurrent schedule S is conflict equivalent to a serial schedule S’, if we can obtain S’ out of S by swapping the order of execution of non-conflicting instructions.Example 1Even if the schedule S1 keeps the database in the consistent state, we cannot convert it into a serial schedule and hence we conclude that the schedule is not conflict equivalent to any of the serial schedules.So, instead of considering only the read and write operation, we will ...
Read MoreWhat do you mean by schedule in DBMS?
A transaction must satisfy the ACID properties of DBMS, namelyAtomicity − Execute all or none transaction.Consistency − The DB should be consistent before and after transaction execution.Isolation − Transaction must be executed in isolated form.Durability − Roll backing should always be possible in Case of any failure.A schedule is defined as an execution sequence of transactions. A schedule maintains the order of the operation in each individual transaction. A schedule is the arrangement of transaction operations. A schedule may contain a set of transactions.We already know that a transaction is a set of operations. To run transactions concurrently, we arrange ...
Read MoreWhat is an expression tree in DBMS?
Expression tree is also called a query tree. It demonstrates an evaluation plan.ExampleConsider an evaluation plan for the given query −Select name from customer, account where customer.name=account.name and account.balance>2000;There are two evaluation plans −Πcustomer.name(σcustomer.name=account.name^ account.balance>2000(customerXaccount)Πcustomer.name(σcustomer.name=account.name(customerXσ account.balance>2000(account)The expression trees for the above evaluation plans are as follows −Cost evaluator evaluates the cost of different evaluation plans and chooses the evaluation plan with lowest cost. Disk access time, CPU time, number of operations, number of tuples, size of tuples are considered for cost calculations.
Read MoreWhat is instance and schema (DBMS)?
The overall design of the database is called database schema. Schema will not be changed frequently. It is the logical structure of a database. It does not show the data in the database.The schema is pictorially represented as follows −Types of SchemaThe different types of schemas are as follows −Physical schema − It is a database design at the physical level.It is hidden below the logical schema and can be changed easily without affecting the application programs.Logical schema − It is a database design at the logical level. Programmers construct applications using logical schema.External − It is schema at view ...
Read MoreExplain the evaluation of relational algebra expression(DBMS)
SQL queries are decomposed into query blocks. One query block contains a single SELECT-FROM-WHERE expression, as well as GROUP BY and HAVING clause (if any). Nested queries are split into separate query blocks.ExampleConsider an example given below −Select lastname, firstname from employee where salary>(select max(salary) from employee where deptname =CSE ; C=(select max(salary) from employee where deptname=CSE); // inner block Select lastname, firstname from employee where salary>c; //outer blockWhere C represents the result returned from the inner block.The relation algebra for the inner block is Ģmax(salary) (σdname=CSE(employee))The relation algebra for the outer blocks is Πlastname, firstname(σsalary>c(employee))The query optimizer would then ...
Read MoreWhat is a query language in DBMS?
Query is a question or requesting information. Query language is a language which is used to retrieve information from a database.Query language is divided into two types as follows −Procedural languageNon-procedural languageProcedural languageInformation is retrieved from the database by specifying the sequence of operations to be performed.For Example: Relational algebraStructure Query language (SQL) is based on relational algebra.Relational algebra consists of a set of operations that take one or two relations as an input and produces a new relation as output.The different types of relational algebra operations are −Select operationProject operationRename operationUnion operationIntersection operationDifference operationCartesian product operationJoin operationDivision operation.Select, project, ...
Read MoreExplain the design constraints on the generalization and specialization (DBMS)?
The different types which we need to consider while designing generalization and specialization in the Database Management System (DBMS) are as follows −Conditional definitionAttribute definedUser definedDisjoint definedOverlapping constraintCompleteness constraintLet us now understand them one by one.Conditional definitionCreate one database, and keep conditions on one attribute for example attendance. This type of constraint is defined on a single attribute which is further dividing an entity into two sub entity sets which will give information for the given attribute.ExampleGiven below is an example of the conditional definition database −Attribute definedThis refers to specifying conditions on more than one attribute.ExampleConsider a database for ...
Read More