Document management system with delimiters defined at run-time

• US 6,012,074 A
• Filed: 03/04/1997
• Issued: 01/04/2000
• Est. Priority Date: 09/17/1993
• Status: Expired due to Fees

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Senn, Jeffrey A., Lucas, Peter
• Primary Examiner(s): Hong, Stephen S.
• Application Number:
  US08/810,838
• Time in Patent Office: 1,036 Days
• Field of Search: 395/793, 395/802, 395/606, 707/531, 707/3, 707/513, 707/514
• US Class Current: 715/235
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: G06F 40/103 Formatting, i.e. changing of presentation of documents automatic justification G06F40/189; automatic line break hyphenation G06F40/191

Abstract

A document management apparatus provides a user to define delimiters in order to specify portions of documents or attributes of documents to be retrieved from a document repository. The repository is searched for the defined delimiters and the portions of the documents or the attributes of documents are retrieved and put into a cache memory. The user-defined delimiters may be multi-character delimiters. The cache memory and the document repository may be connected over a network.

Claims

1. In a computer network formed of a plurality of nodes, a document management apparatus, comprising:

a repository for storing at least one document, the repository being formed of memory of a first node in the network;

means for a user at search run-time to define a delimiter said delimiter indicating a location in said at least one document;

a working memory directly coupled to a processor, the working memory and processor being of a second node in the network;

means for launching a search of said at least one document in said repository for a first occurrence of said delimiter, and for launching a search of said at least one document for a second occurrence of said delimiter;

means responsive to said means for launching a search, for retrieving a chunk of said at least one document from said repository, said chunk of said at least one document from said repository beginning after the first occurrence of said delimiter and ending before the second occurrence of said delimiter; and

means for transferring and depositing said chunk of said at least one document in said working memory of the second node such that portions smaller than whole attributes of documents and portions smaller than whole documents are transported across the network thereby reducing network traffic.

2. An apparatus as in claim 1 wherein said delimiter has multiple characters.

3. An apparatus as in claim 1 wherein said repository and said cache are connected over a network.

4. An apparatus as in claim 1 wherein said delimiter is a null delimiter.

5. An apparatus as in claim 1 wherein said means for launching a search further comprises a means for executing a chunk expression, said chunk expression comprising said delimiter.

6. An apparatus as in claim 5 wherein said means for executing a chunk expression further comprises a means for determining if said chunk of said at least one document defined by the first occurrence of the delimiter and the second occurrence of the delimiter requested in the chunk expression is in said working memory directly coupled to the processor of the second network node.

7. An apparatus as in claim 1 wherein said delimiter has one character.