Method for accessing a data set in a word processing system

• US 4,620,295 A
• Filed: 03/06/1984
• Issued: 10/28/1986
• Est. Priority Date: 03/07/1983
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Aiken, John A. Jr.
• Primary Examiner(s): Zache, Raulfe B.
• Application Number:
  US06/586,594
• Time in Patent Office: 966 Days
• Field of Search: 364/900 MS File
• US Class Current: 715/234
• CPC Class Codes: G06F 16/9017 using directory or table look-up use of a directory or look-up table in file systems G06F16/13

Abstract

A word processing system is disclosed in which a text stream is stored on a direct access storage device (DASD) for recall and editing. The text stream is organized into a document, which is stored on the DASD as a data set. The data set consists of an index portion and a portion containing text records. The index portion is divided into nodes, of which the primary node is called the root node. When the system operator designates a data set for use, the root node is fetched and retained in a system memory to eliminate the need to fetch it from the DASD for every access. When sequential records are accessed, such as during a document duplication operation, the index is fully searched only for the first of the sequential records. Subsequent records are located through index nodes already in the system memory, with subsequent index nodes being fetched from the DASD only when the last index entry in the current index node has been processed. When sequential records are written to the DASD, the index is fully searched only for the insertion point for the first record. For subsequent records, the same index node is updated until there is insufficient room for index entry for the latest record written to the DASD. At that time the index node is split and index entries at higher levels of the index are updated in a similar manner.

Claims

1. In a word processing system including a system memory and a direct access storage device (DASD) storing an input text stream where text may be selected later for revision, a method for accessing a data set in the word processing system comprising:

performing an open data set for access operation by first searching the current volume index on the DASD for a desired data set based on the data set name and a data set type;

fetching a data set root index node into an interface control block in the storage access control block section of system memory;

requiring the storage access control block to remain available at the same memory location for all subsequent accesses to the data set until a close data set operation is performed; and

using the root node stored in the storage access control block for all subsequent searches and updates to the data set index.

2. A storage access method according to claim 1 further comprising:

requiring each index node of a data set not to exceed a specified maximum length when updating the data set index for the inclusion of additional records or pages to the existing data set;

requiring the root node of a data set index to be a unique index node at the highest existing level of said data set index;

requiring each index node to contain index entries of either individual pages and records of the data set or of next lower level index nodes;

building an additional next-to-highest index level where necessary to prevent the said root node from growing beyond the said maximum length specification;

splitting a non-root level index node where necessary to prevent such node from growing beyond the said maximum length specification; and

updating as necessary any higher level index nodes when some lower level index node is split.

3. A storage access method according to claim 2, further comprising:

fetching a lower level index node into an index node buffer of an internal control block in the system memory when called for by an index entry found in a higher level node; and

using the said lower level index node stored in said index node buffer of the internal control block for all subsequent searching of and sequential accessing to the index entries contained within said index node as long as said stored index node does not have to be replaced in said buffer.

4. A storage access method according to claim 3, further comprising:

providing a chain of index entries for adjacent index nodes of equal level within each node of non-root level;

using the chained index entries of an index node stored in said index node buffer for access to a next index node of the same level in any sequential access operations going beyond the index entries contained within said stored node, whereby a renewed access of and search in higher level nodes is superfluous; and

updating as necessary said chained index entries contained in the adjacent nodes of a stored index node of non-root level when said stored node is being split.

5. A storage access method according to claim 1, 2, 3 or 4 further comprising:

requiring the root node of a data set index to contain an entry providing a data set profile comprising the data set name and a data set comment; and

checking the data set name for the expected root node of a desired data set as soon as said root node is fetched into a storage access control block in system memory.

6. A storage access method according to claim 1, 2, 3, or 4 further comprising:

including a key information field within each page or record index entry contained in any index node at a leaf level of a data set index;

including a high key value information field within each leaf node index entry contained in any non-leaf level index node, wherein such a high key value corresponds to the highest value among the keys of the pages or records for which index entries are found in the leaf node pointed to by said leaf node index entry; and

inserting page or record index entries for any additional pages or records of the data set only in selected positions of selected leaf index nodes such that keys of sequential page or record index entries appear in an ascending sequence within each leaf node as well as through all leaf nodes,

whereby efficient search operations by key values of desired pages or records are feasible through the data set index.

7. A storage access method according to claim 3, further comprising:

providing a plurality of index node buffers within said internal control block sufficient in number to accommodate any index node operations as required for inserting additional record, page, leaf or intermediate index entries, building sub-root level index nodes, splitting a sub-root index node, or any other updating of data set index, and searching or sequential accessing index nodes of any sub-root level