Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
difference between left outer join and right outer joinin left outer join tuples from the left-hand-side relation which do not match any tuple in the
explain the difference between drop and deletedelete deletes one or more than one tuples of a particular relation from the database drop is employed
what is the difference between where and having clausespredicates in the where clause applies to every tuple while the predicate in the having clause
differentiate between a subquery and a joinif we need to acquire information from one or more tables after that either subquery or join can be used
explain the structure of well formed formulae in relational calculusans a an atom is a formulab if p1 is a formula after that so are notp1 and p1c if
define cardinality and participation constraints on a relationship type completeness constraint on generalization ans
explain the role of a database administratora defining the schema the dba describes the schema which consists of the structure of the data in
what is outer join they can be employed while we want to keep all the tuples in r or all those in s or all those in both relations in the result
explain the theta-join and equijoinrefer tables car and boat which list models of cars and boats and their relevant prices assume a customer wants to
explain the natural joinnatural join is a binary operator which is written as r s in which r and s are relations the effect of the natural join is
what are deadlocks how can they be avoided ans deadlock considers to a particular condition when two or more processes are every waiting for
differentiate between static hashing and dynamic hashing ans static hashing comprises the number of primary pages in the directory fixed so while
how does a query tree represent a relational algebra expression ans this includes transforming an initial expression tree into an
what is indexed sequential file organization what are the applications of this organization ans an index file can be employed to effectively
what are the reasons of bucket overflow explain any two methods for solving this problemans it is general for file structures to be divided into
define the boyce-codd normal form with instance and also compare bcnf and 3nf ans bcnf for each functional dependency x-gty in a set f of
what is ddl make a list of commands with short description used in ddlans data definition language that is abbreviated as ddl is a computer language
how relational calculus is different from relational algebra what do understand by trc queries and drc queries ans relational calculus contain two
explain the steps for reduction of e-r model into relational modelansa entity set in e-r model will be considered as table name in relational modelb
explain the shadow paging recovery technique ans shadow paging is a method used to acquire atomic and durable transactions and provides the
what is a view make a view of emp table named dept 20 to display the employees in department 20 and their annual salary ans view is a
what are the general transformation rules for relational operations ans the transformation rules transform one relational algebra expression to
define radix conversion method one clever way to transform binary numbers to bcd notation binary-coded decimal is the double dabble algorithm it
explain the relational completenesscodd described the term relational completeness to consider to a language that is complete with respect to
explain the query processing data query processing permits a user to report or analyze structured and unstructured data pulled from multiple data