A sort key must be built on any relation to be able to sort it. Then the sorted relation can be read using the index

1. A sort key must be built on any relation to be able to sort it. Then the sorted relation can be read using the index.

  1. Sort
  2. Primary
  3. Index
  4. Composite

Answer: A) Sort

Explanation:

A sort key must be built on any relation to be able to sort it. Then the sorted relation can be read using the index.

Comments and Discussions!





Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.