File organization concepts: within a database or file system, what do we call the sequential organization of records ordered by a common key (e.g., customer ID in ascending order)?

Introduction / Context:
Data files can be organized in multiple ways to balance read/write performance and access patterns. One basic approach is to store records sequentially in order of a key, enabling efficient sequential scans and range processing. Recognizing the correct terminology prevents confusion with index-based or logical design concepts.

Given Data / Assumptions:

• The file is stored in order of a single key (e.g., sorted by account number).
• Primary access is via sequential reads or merges.
• No secondary index is assumed for direct keyed access.

Concept / Approach:
A simple (sequential) structure stores records in physical order by a key, supporting batch processing, reporting, and merge operations. An inverted structure refers to an index (or set of indexes) that maps key values to record locations, enabling rapid direct access—distinct from simple sequential storage. A logical structure describes the conceptual schema rather than the physical ordering or access path, so it does not name a specific storage organization method.

Step-by-Step Solution:

Verification / Alternative check:
Classic file processing texts catalog sequential, indexed-sequential (ISAM), and inverted/indexed organizations; pure sequential aligns with the “simple” designation here.

Why Other Options Are Wrong:

• Logical structure: Refers to conceptual design, not physical order.
• Inverted structure: Uses indexes; not a simple sequential organization.
• All/None: Incorrect given the distinctions above.

Common Pitfalls:
Assuming an index exists just because records are sorted; conflating physical ordering with logical schema definitions.

Final Answer:
simple structure