Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
define hash files organizationa hashing includes computing the address of a data item by calculating a function on the search key value b a
explain the cascadeless schedulea cascadeless schedule is one in which for every pair of transactions ti and tj like that tj reads a data item before
explain the recoverable schedule a recoverable schedule is one in which for each pair of transactions ti and tj such that tj reads a data item
explain thomas write rule show how it is different from timestamp ordering protolans in timestamp-based concurrency control the thomas write rule
describe the algorithm for updating indices for a single level index when a record is i inserted ii deletedwhat will be the
describe the four main ways of optimising disk block accessans a disk b non-volatile writes buffersc file organization clusteringd log-based file
define multivalued dependency what do understand by trivial multivalued dependency ans a multivalued dependency is a full constraint among two
define atom of domain relational calculus an atom has the outline lt x1 x2 xn gt -gt r in which r stands for a relation on n attributes and x1 x2
explain what is relation a database relation is a predefined row or column format for storing information in a relational database relations are
explain the attribute inheritanceans throughout the rendering of the objects in a view attribute sets of objects higher in the view hierarchy are
explain the weak entity set an entity set which does not have sufficient attribute to make a primay key is known as weak entity set for instance
explain superkeyans a superkey is described in the relational model of database organization like a set of attributes of a relation variable for
define the concept of aggregation give two examples where this concept is useful ans aggregation transforms a relationship among the objects into
briefly describe the different kinds of users of a dbms ans different sorts of dbms users area software engineers these are the people
compare the two log-based recovery schemes in terms of ease of implementation and overhead cost ans there are two types of log based
prove that a relation which is 4nf must be bcnf ans let r be in 4nf suppose it is not in bcnf hence there exists an fd xrarry in r
explain recovery process after system failure using checkpointans checkpoint scheme or method is an extra component of the log based recovery system
explain strict two-phase lockinga transaction t does not release any type of its exclusive x locks until that transaction commits or aborts in this
the database will enable college administrators the ability to track students initial major this will help college officials decide how best to
explain dynamic two-phase locking here a transaction locks a data item instantly earlier than any operation is applied on the data item after
explain the static or conservative two phase lockingstatic or conservative two phase locking in this type of scheme all the data items are locked
explain the concept of two-phase lockingit concerns the positions of locking and unlocking operations in each transaction in this protocol every
what is meant by heuristic optimisationdiscuss the major heuristics that are applied during query
what are the three data anomalies that are similarly to take place as a result of data redundancy can data redundancy be completely eliminated in
describe the storage structure of indexed sequential files and their access methodans index offers a lookup capability to rapidly reach the vicinity