Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
explain growing phase of lockinggrowing phase in this phase the transaction can only obtain locks but cannot release any lock the transaction enters
depending upon the rules we have found we can classify the locks into two typesshared lock a transaction might be acquiring shared lock on a data
lock based protocola lock is nothing but a mechanism that tells the dbms whether a particular data item is being used by any transaction for
what is a transaction a transaction is an event which happens on the database generally a transaction reads a value from the database or writes a
multilevel index the multilevel index is a modification of the secondary level index system in this system we might be use even more number of levels
what is secondary indexwhile making the index generally the index table is kept in the primary memory ram and the main table because of its size is
primary indexin primary index there is a one-to-one relationship among the entries in the index table and the records in the major table primary
what is an indexan index is a small table having only two columns the first column has a copy of the primary or candidate key of a table and the
fifth normal form 5nfthese relations still have a difficulty while defining the 4nf we mentioned that all the attributes depend upon each other
fourth normal form 4nf when attributes in a relation have multi-valued dependency further normalization to 4nf and 5nf are needed let us first find
boyce-code normal form bcnfa relationship is said to be in bcnf if it is already in 3nf and the left hand side of each dependency is a candidate key
first normal form and second normal formfirst normal form 1nfa relation is said to be in 1nf if it having no non-atomic values and each row can give
un-normalized form unfif a table having non-atomic values at every row it is said to be in unf an atomic value is something that cannot be further
define network dbmsthe ndbms is built primarily on a one-to-many relationship but where a parent-child representation between the data items cannot
what is hierarchical dbmsin hdbms data is structured in a tree like manner there is a parent-child relationship between data items and the data model
what is relational dbmsthis is our subject of study a dbms is relational if the data is organized into relations that is tables in rdbms all data are
determine the strong and weak entitybased on the method of foreign key there might be arise a situation when we have to relate an entity having a
what is foreign keyforeign key sometimes we may have to work with an attribute that does not have a primary key of its own to recognize its rows we
describe the composite keycomposite key sometimes one key is not enough to uniquely recognize a row eg in a single class roll is enough to search a
what is alternate keyalternate key this is the candidate key which is not taken as the primary key of the table they are named so because although
explain about primary keyprimary key it is one of the candidate keys that are taken to be the recognizing key for the entire table eg although there
what is candidate keysuper key or candidate key it is such an attribute of a table that can uniquely recognize a row in a table generally they have
cardinality of relationshipone-to-oneonly one entity of the first set is linked to only one entity of the second set eg a teacher teaches a student
state the terms designing the database and normalizationdesigning the database out of the erd we have formed it is very easy to verify the tables the
what is gathering information and producing erdgathering information this could be a written document that explains the system in question with