Home

Which one is true statement :

A. With finer degree of granularity of locking a high degree of concurrency is possible.

B. Locking prevents non-serializable schedules.

C. Locking cannot take place at field level.

D. An exclusive lock on data item X is granted even if a shared lock is already held on X.

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. In multiple granularity of locks SIX lock is compatible with
  2. _____ database is used to provide statistical information or summaries of values based on various criteria.
  3. The transactions like adding an employee, enrolling a student in a course are examples of _______
  4. If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
  5. Protection of data from unauthorized Disclosure results in loss of _______
  6. Between DRAM and magnetic disk storage another form of memory, called ______ memory is becoming common…
  7. _____ First proposed the process of normalization.
  8. Which normal form is considered adequate for normal relational database design?
  9. The _____ category includes storage media that can be operated on directly by the computers central…
  10. An advantage of the database management approach is
  11. The size of a data item is called its _______, which can be a field of some record or may be a larger…
  12. _____ is a utility to capture a continuous record of server activity and provide auditing capability.
  13. A top-to-bottom relationship among the items in a database is established by a
  14. ______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
  15. A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer…
  16. What is a disjoint less constraint?
  17. In SQL the statement select * from R, S is equivalent to
  18. The data models defined by ANSI/SPARC architecture are
  19. The concept of mapping of ______ entity types is the concept in which the for each strong entity type…
  20. Dependency preservation is not guaranteed in
  21. _____clause is an additional filter that is applied to the result.
  22. By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0)…
  23. Which of the following addressing modes permits relocation without any change over in the code?
  24. Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum…
  25. When an E-R diagram is mapped to tables, the representation is redundant for
  26. Which of the following is not a recovery technique?
  27. Immediate database modification technique uses
  28. If an entity can belong to only one lower level entity then the constraint is
  29. Employees in a company are each assigned their own office, i.e. for each employee there exists a unique…
  30. The ______ indexes are forced to store only record IDs in the data structure and require at least one…