1Z0-052 · Question #136
Identify the logical structure that will never have more than one data segment created for it.
The correct answer is D. nonclustered table. A nonclustered (heap-organized) table is always backed by exactly one data segment, unlike partitioned structures which allocate one segment per partition.
Question
Identify the logical structure that will never have more than one data segment created for it.
Options
- Aexternal table
- Bpartitioned table
- Cpartitioned index
- Dnonclustered table
- Eglobal temporary table
How the community answered
(37 responses)- A3% (1)
- C5% (2)
- D81% (30)
- E11% (4)
Why each option
A nonclustered (heap-organized) table is always backed by exactly one data segment, unlike partitioned structures which allocate one segment per partition.
An external table has zero data segments because its data resides in operating system flat files outside the database, not in any Oracle-managed segment.
A partitioned table allocates one data segment per partition, so any table with two or more partitions already has multiple data segments.
A partitioned index similarly allocates one index segment per partition, routinely resulting in multiple segments for any multi-partition index.
A nonclustered heap table stores all of its rows in a single data segment by definition, regardless of data volume. Unlike partitioned tables or indexes, which allocate a distinct segment for each partition, a heap table has no mechanism to split data across multiple segments. This architectural constraint means it is the only choice that is guaranteed to never have more than one data segment.
A global temporary table allocates a separate private temporary segment for each session that inserts data into it, so multiple concurrent sessions produce multiple active segments.
Concept tested: Oracle data segment allocation by table and index type
Source: https://docs.oracle.com/en/database/oracle/oracle-database/19/cncpt/logical-storage-structures.html
Topics
Community Discussion
No community discussion yet for this question.