Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
explain the difference between the three storage types - volatile non volatile and stable ans volatile
explain pipelining ans in order to describe pipelining in simple terms think of it as breaking down processor functions into
explain the rules for creating a labelled precedence graph for testing view serializability ans a schedule
illustrate the statement projection operation distributes over the union operation give an example ans pile1 cup e2 pile1 cup
define and differentiate between ordered indexing and hashingans ordered indexing to gain fast random access to records in a file we can make of an
describe sequential file organization explain the rules for i inserting a new record ii deleting an existing
what are the problems if one were not to normalize when do these problems surface ans database
define the division operation of relational algebralet r be a relation comprising attributes a1apap1an and s comprising attributes ap1an def
what is completeness constraint on generalization define the variation between total and partial design constraint give an example
explain the b tree b tree is a type of tree which denotes sorted data in a way that permits for efficient insertion retrieval and removal of records
define assertions in sqla an assertion is a predicate that is expressing a condition we wish the database to always satisfy b domain constraints
what is data dictionarya data dictionary is a reserved space in a database that is employed to store information about the database itselfa data
views in relational algebra 1 basic expression contains either a a relation in the databaseb a constant relation2 general expressions
what are the costs to be considered when a transaction has to be rolled back when recovering from deadlock ans a few
compare wait-die deadlock prevention scheme with wait-wound scheme ans wait-die scheme a based upon a nonpreemptive technique b if
explain the acid properties of a transactionans acid properties are a significant concept for databases the acid stands for atomicity consistency
compare the nested-loop join and block-nested loop joinans nested loop join - it is costly as worst case cost no of block accesses needed is nr
describe the nested-loop join and block-nested loop join ans the block nested- loop join algorithm is as described
differentiate between strict two-phase and rigorous two-phase with conversion protocolans strict two-phase locking holds all its exclusive that