Method for Minimizing Index Paging Operations in Text Processing
Original Publication Date: 1985-Mar-01
Included in the Prior Art Database: 2005-Feb-18
A method is described for minimizing paging operations in a text processing program where documents are represented as records which are addressed by logical sector numbers (LSN). Documents in a word processing program are represented as records, which are addressed by LSNs and located by a two-level index having multiple nodes and which is ordered by relative record number (RRN). Text processing programs delimit pages in the dataset by assigning a key to the first record of a page and logically inserting the remaining records of the page behind the keyed pages. A page therefore consists of a keyed record and all the unkeyed records which logically follow that record and precede the next keyed record.