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
-
Economics & Finance
Articles by Bhanu Priya
Page 88 of 107
Explain the stages and their examples of database development lifecycle (DBMS)?
Let’s see the stages of database system life cycle (DDLC) and their facts using tabular form −Stage of Database system development LifecycleExample of FactsExample of Documentation ProducedDatabase PlanningAims and objectives of database projects.Mission statements and objectives.System IdentificationDescription of major user views (Job roles, business application areas).Definition of scope and boundary of database system, definition of user views to be supported.Requirements Collection and AnalysisRequirements of user views, system specifications, including performance and security requirements.User requirement specification, system specification.Database designUser’s responses to checking the logical database design, functionality provided by target DBMS.Logical database design, data dictionary, physical database design.Application DesignUsers’ response to ...
Read MoreWhat are the different phases of database development Life cycle (DBMS)?
The different phases of database development life cycle (DDLC) in the Database Management System (DBMS) are explained below −Requirement analysis.Database design.Evaluation and selection.Logical database design.Physical database design.Implementation.Data loading.Testing and performance tuning.Operation.Maintenance.Now, let us understand these phases one by one.Requirement AnalysisThe most important step in implementing a database system is to find out what is needed i.e what type of a database is required for the business organization, daily volume of data, how much data needs to be stored in the master files etc.In order to collect all this information, a database analyst spends a lot of time within the business ...
Read MoreWrite queries using aggregate functions in relational algebra (DBMS)?
The aggregate functions are follows −max()min()sum()average()count()Consider the following tables −Employee − Emp(empid, ename, salary)EmpidEmpnameSalaryE1Ravi4000E2Sanjay3500E3Sruthi3000E4Alok3000E5Pritam3000Dept − Dept(deptid, dname)DepidDnameD1CseD2EceD3CivilProject − Project(projected, pname)ProjectidPnameP1DatabaseP2networkingWorksin − Worksin(empid, depid)EmpidDepidE1P1E2P2E3P1E4P2E5P2Assign − Assign(empid, projectid)EmpidProjectidE1P1E2P2E3P1E4P2E5P2Example 1Display the details of the employee who works in the ece department.Step 1Use the below mentioned syntax. Here, T1= deptid of EceT1=∏deptid(σdname=ece(dept))OutputDeptidD2Step 2Here, ⋈= {T1.deptid=worksin.deptid} and T2= all empid of EceT2= ∏empid(T1⋈worksin)OutputEmpidE3E4Step 3Here, T3=(T2⋈emp), ⋈={T2.empid=emp.empid} and T3= details of all employees of EceEmpidEmpnameSalaryE3Smruthi3000E4Alok3000Example 2Display all names of employees who work on database projects.Step 1Use the command mentioned below −T1=∏projectid(σpname=database(project))OutputProjectidP1Step 2Use the command given below −T2= ∏empid(T1⋈assign)OutputEmpidE1E2Step 3Use the command given below −T3= ∏empname(T2⋈emp)OutputEmpnameRaviSmruti
Read MoreExplain cartesian product in relational algebra (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 −Procedural languageNon-procedural languageProcedural languageInformation is retrieved from the database by specifying the sequence of operations to be performed.For Example − Relational algebra.Structure 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.Types of Relational Algebra operationsThe different types of relational algebra operations are as follows −Select operationProject operationRename operationUnion operationIntersection operationDifference operationCartesian ...
Read MoreWhat is an optimistic concurrency control in DBMS?
All data items are updated at the end of the transaction, at the end, if any data item is found inconsistent with respect to the value in, then the transaction is rolled back.Check for conflicts at the end of the transaction. No checking while the transaction is executing. Checks are all made at once, so low transaction execution overhead. Updates are not applied until end-transaction. They are applied to local copies in a transaction space.PhasesThe optimistic concurrency control has three phases, which are explained below −Read PhaseVarious data items are read and stored in temporary variables (local copies). All operations ...
Read MoreExplain about the Time stamp ordering protocol in DBMS
The timestamp-ordering protocol ensures serializability among transactions in their conflicting read and write operations. This is the responsibility of the protocol system that the conflicting pair of tasks should be executed according to the timestamp values of the transactions.A conflict occurs when an older transaction tries to read/write a value already read or written by a younger transaction. Read or write proceeds only if the last update on that data item was carried out by an older transaction.Otherwise, the transaction requesting read/write is restarted and gives a new timestamp. Here no locks are used so no deadlock.The timestamp of transaction ...
Read MoreExplain serial execution or transaction with an example(DBMS)
There are three possible ways in which a transaction can be executed. These are as follows −Serial execution − In serial execution, the second transaction can begin its execution only after the first transaction has completed. This is possible on a uniprocessor system.Parallel execution − In parallel execution, two transactions can start their execution at exactly the same instant of time. For this, we require more than one processor.Concurrent execution − In concurrent execution, execution of the second process can begin even before the process has completed its execution.Let us consider two transactions T1 and T2. In concurrent execution, the ...
Read MoreExplain 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 More