Which of the following is true for network structure?

A. It is a physical representation of the data.

B. It allows many to many relationship.

C. It is conceptually simple.

D. It will be the dominant database of the future.

You can do it
  1. Maximum height of a B+ tree of order m with n key values is
  2. Which of the following is not comparison operator?
  3. When an E-R diagram is mapped to tables, the representation is redundant for
  4. Which is the best file organization when data is frequently added or deleted from a file?
  5. _____ is a utility to capture a continuous record of server activity and provide auditing capability.
  6. Which of the following relational algebraic operations is not from set theory?
  7. The cost of reading and writing temporary files while evaluating a query can be reduced by
  8. _______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal…
  9. In a multi-user database, if two users wish to update the same record at the same time, they are prevented…
  10. DBMS is a collection of _____ that enables user to create and maintain a database.
  11. What are the desirable properties of a decomposition
  12. Isolation of the transactions is ensured by
  13. The set of all values that can be taken by the attribute is called as _______ of the attribute.
  14. If a transaction T has obtained an exclusive lock on item Q, then T can
  15. A list consists of last names, first names, addresses and pin codes. If all people in the list have…
  16. The _____ category includes storage media that can be operated on directly by the computers central…
  17. The rule that a value of a foreign key must appear as a value of some specific table is called a
  18. ____specifies a search condition for a group or an aggregate.
  19. A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation…
  20. Tree structures are used to store data in
  21. The language that requires a user to specify the data to be retrieved without specifying exactly how…
  22. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  23. The graphical representation of a query is .
  24. If the closure of an attribute set is the entire relation then the attribute set is a
  25. The part of a database management system which ensures that the data remains in a consistent state is
  26. Which of the following relational algebra operations do not require the participating tables to be union-compatible?
  27. The collection of information stored in a database at a particular moment is called as ......
  28. The metadata is created by the
  29. Which two files are used during operation of the DBMS?
  30. Which of the following is not a property of transactions?