The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is

A. View

B. Order by

C. Group by

D. Having

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

You can do it
  1. The ______ indexes are forced to store only record IDs in the data structure and require at least one…
  2. Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
  3. The part of a database management system which ensures that the data remains in a consistent state is
  4. A table can have only one
  5. In multiple granularity of locks SIX lock is compatible with
  6. Drop Table cannot be used to drop a table referenced by a ______ constraint.
  7. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
  8. The one guideline to be followed while designing the database is
  9. Data items grouped together for storage purposes are called a
  10. What is data integrity?
  11. DFD stands for
  12. Shadow paging has
  13. _____ is a utility to capture a continuous record of server activity and provide auditing capability.
  14. Maximum height of a B+ tree of order m with n key values is
  15. Precedence graphs help to find a
  16. The cost of reading and writing temporary files while evaluating a query can be reduced by
  17. The collection of information stored in a database at a particular moment is called as ......
  18. DBMS helps achieve
  19. Which of the following is true for network structure?
  20. A top-to-bottom relationship among the items in a database is established by a
  21. Dependency preservation is not guaranteed in
  22. An advantage of views is
  23. An advantage of the database management approach is
  24. Wait-for graph is used for
  25. As per equivalence rules for query transformation, selection operation distributes over
  26. Which two files are used during operation of the DBMS?
  27. The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces…
  28. A _____ is a logical unit of database processing that includes one or more data access operations that…
  29. In b-tree the number of keys in each node is than the number of its children.
  30. Which of the following is a reason to model data?