Page indexing system for accessing sequentially stored data representing a multi-page document

• US 4,571,700 A
• Filed: 06/16/1983
• Issued: 02/18/1986
• Est. Priority Date: 06/16/1983
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Pfeuffer, Margaret S., Emry, Carl A. Jr., Neuman, Grover H., Mersiovsky, Lynda K.
• Primary Examiner(s): Thomas, James D.
• Assistant Examiner(s): Williams, Jr., Archie E.
• Application Number:
  US06/504,825
• Time in Patent Office: 978 Days
• Field of Search: 364/200 MS FILE, 364/900 MS FILE, 364/518, 360/72.1, 360/72.2, 353/25, 353/26 A, 400/61, 400/83, 355/3 R, 358/256
• US Class Current: 1/1
• 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
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A document indexing method and apparatus facilitates access to sequentially stored documents in a word processing system. The invention uses random access memory in the word processor to build a page index when the sequential data stream is first processed. The page index is then available so that subsequent access to previously processed pages is faster than conventional sequential access. The page index has associated with it an offset index having pointers to the actual entries in the page index. If the page index proves too small to store a index entry for every single page of a document, the offset index is reorganized to point to every other entry in the page index. Reorganization effectively doubles the span of pages covered by the page index and may be repeated a plurality of times to allow a sequentially stored document of arbitrary length to be indexed by a fixed length page index.

Claims

1. A word processing and data accessing system for keeping track of page entities in a sequential data stream representative of a multipage document comprising:

a first storage means for storing said data stream;

a second storage means connected to said first storage means and to a document converter;

said second storage means including a page index having a fixed number of positions for storing the locations of said page entities in said stored data stream by being set to the address in which selected pages of said data stream have been stored in said first storage means;

said document converter means connected to said first storage means and to said second storage means for determining the page entities of said document in said stored data stream;

an index manager connected to said second storage means for monitoring of said second storage means to recognize a request for a page in said first storage means which is beyond the present addressing capacity of said fixed number of storage positions in said page index;

said index manager reorganizing said page index by altering selected addresses to increase the number of page entities represented by each storage position in said page index.

2. The word processing and data accessing system according to claim 1 further including an offset index in said second storage means for maintaining the page locations of the positions of the entries in said page index means;

said page index being reorganized by said offset index keeping alternate positions in an unchanged condition and freeing all remaining positions for storage of the next series of odd page numbers, each entry in said series being controlled by a shift factor which starts at zero and is increased by one for each time that said page index is reorganized, said series beginning at the next odd number higher than the highest page number which has been kept in an unchanged condition in said offset index to allow doubling of the number of page entities represented by each storage position in said page index.

3. A method for maintaining an index of page entities in a sequential data stream representative of a multipage document including the steps of:

storing said sequential data stream in a first storage;

determining the locations of the page entities within said sequential data stream;

storing the addresses of selected ones of said page entities in a second storage having a fixed number of positions for storage of a page entity in each position;

storing page entity locators of said second storage in a third storage which has a number of locator positions equal to the fixed number of positions for storage of page entities in said second storage;

reorganizing said second and third storage means by erasing selected positions of said page entity locators in said third storage means thereby releasing each page entity position in said second storage relating to said erased page entity locator in said third storage;

entering new storage page entities into released positions in said second storage;

entering new page entity locators into said third storage which are higher numbered than said erased locators;

increasing the number of pages spanned by said second storage means by said reorganization.

4. The method according to claim 3 wherein the reorganization of said second storage means includes the steps of:

erasing alternate positions of said third storage means;

entering new page entity locators in said erased positions which are higher numbered than the highest numbered erased position;

doubling the number of pages spanned by said second and third storage means through the entering of a new page entity locator in each alternate position of said third storage means.

5. The method according to claim 4 wherein all odd numbered positions of said second store are dept unchanged and all even numbered positions of said second store are freed for storage of new page index location data.