Rows corresponding to each value of hash function sorted in Ascending Order - Oracle Clusters

Q.  In a sorted hash cluster, the rows corresponding to each value of the hash function are sorted on a specified set of columns in which order and that can improve response time during subsequent operations on the clustered data?
- Published on 12 Aug 15

a. Descending order
b. Ascending Order
c. Equal
d. None of the above

ANSWER: Ascending Order

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 02 Sep 15
    - Hash clusters group table data by applying a hash function to each row's cluster key value.

    - All rows with the same cluster key value are stored together on disk.

    - Consider the benefits and drawbacks of hash clusters with respect to the needs of the application.

    - You might want to experiment and compare processing times with a particular table as it is stored in a hash cluster, and as it is stored alone with an index.

    - Use sorted hash clusters, where rows corresponding to each value of the hash function are sorted on a specific columns in ascending order, when response time can be improved on operations with this sorted clustered data.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲