Select the appropriate data structure associated with each phrase. Individual data files are not integrated with other files and end users own their own data files rather than sharing the files with other users. All records in the file lie in contiguous storage spaces in a specified sequence by primary key. Applications start a the beginning of the file and and process each record in sequence. A separate index which itself is a file of record addresses, contains the numeric value of the physical disk storage location for each record in the associated data file. Employs an algorithm that converts the primary key of a record directly into a storage address. Eliminates the need for a separate index. Stores in a field of one record the address of a related record. Records are spread over the entire disk without concern for the physical proximity with other related records. Designed to support flat-file systems already in place, while allowing the organization to move to new levels of data integration. Linkages are provided between logically related files, and a third dimension is added to better serve multiple-user needs. Uses an index in conjunction with a sequential file organization to facilitate both direct access to individual records as well as batch processing of an entire file. Multiple indexes can be used to create a cross-reference file to allow even more flexible access to data. Data processing is performed by standalone applications rather than integrated systems. A single-view model that characterizes many legacy systems. Uses a random file organization because the process of calculating residuals and converting them into storage locations produces widely dispersed record addresses. Has foundations in relational algebra and set theory. Represents data in the form of two-dimensional tables. A. Flat-File Structure B. Indexed Structure C. Relational Database Structures D. Sequential Structure E. Hashing Structure F. Pointer Structure G. Hierarchical and Network Database Stuctures