In b-tree the number of keys in each node is than the number of its children.

A. one less

B. same

C. one more

D. half

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

You can do it
  1. The cost of reading and writing temporary files while evaluating a query can be reduced by
  2. The size of a data item is called its _______, which can be a field of some record or may be a larger…
  3. HSAM stands for ……….
  4. A table can have only one
  5. Grant and revoke are _____ statements.
  6. Which of the following is a reason to model data?
  7. An advantage of views is
  8. The middleware databases in which the business rules act are applicable to _______ tier architectures
  9. Relational Algebra is
  10. Which of the following is not a logical database structure?
  11. Tree structures are used to store data in
  12. The rule that a value of a foreign key must appear as a value of some specific table is called a
  13. A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation…
  14. The concept of mapping of ______ entity types is the concept in which the for each strong entity type…
  15. Which of the following relational algebraic operations is not from set theory?
  16. An outstanding functionality of SQL is its support for automatic_____ to the target data.
  17. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  18. Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
  19. Which of the following is not comparison operator?
  20. According to the levels of abstraction, the schema at the intermediate level is called
  21. Which one is true statement :
  22. Employees in a company are each assigned their own office, i.e. for each employee there exists a unique…
  23. The default level of consistency in SQL is
  24. Change Staff table by removing default of Assistant for position column
  25. The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all…
  26. In b-tree the number of keys in each node is than the number of its children.
  27. If a transaction T has obtained an exclusive lock on item Q, then T can
  28. For correct behaviour during recovery, undo and redo operation must be
  29. A top-to-bottom relationship among the items in a database is established by a
  30. It is an abstraction through which relationships are treated as higher level entities