System and method for storing and managing information

• US 5,418,942 A
• Filed: 07/06/1989
• Issued: 05/23/1995
• Est. Priority Date: 07/06/1989
• Status: Expired due to Term

• Current Assignee: Ralphalpha LLC
• Original Assignee: Barton B. Smith, Kenneth V. Krawchuk
• Inventors: Krawchuk, Kenneth V., Smith, Barton B.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Wang, Peter Y.
• Application Number:
  US07/376,123
• Time in Patent Office: 2,147 Days
• Field of Search: 364/200, 364/900, 395/600
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: Y10S 707/917 Text
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

This invention is an information storage system which provides a self-contained environment for database management. Data are stored in the system not as conventional entries in memory locations, but instead as a group of connections between database sets. Procedures are also encoded as database set connections, and not in conventional form. Data and procedure cannot exist independently, in the present invention; instead, they are grouped together, into constructs called Contexts. Because the connections themselves are the data, the system is substantially independent of the particular hardware on which the system is implemented. The environment includes an editor which uses an icon-based syntax to create and manipulate data and procedure structures according to the invention. The present invention greatly reduces the time required to develop and maintain a database management system or other computer program. The system is not limited by the size of data variables. Also, a change in a data value, in one location, automatically changes that value throughout the system. Programs designed with the environment of the present invention are easier to code than conventional programs, and are generally self-documenting.

Claims

1. An information storage system which is connectable to an input interface means and an output interface means, the information storage system comprising a computer, the computer having a memory, the memory of the computer having a plurality of nodes stored therein, each node having a unique identifier within the memory, the memory of the computer including means defining pointers between pairs of said nodes, the pointers comprising only identifiers of other nodes, the pointers having been assigned by the input interface means in response to transmission of input data to the input interface means by a user, wherein each node contains no application data elements other than pointers, wherein information to be stored is stored only as a pattern of said pointers, and wherein said stored pattern is convertible by the output interface means into data recognizable by the user.

2. The system of claim 1, wherein the information being stored includes both data and procedure information, and wherein data and procedure are arranged in a structure called a Context, wherein every Context contains both data and procedure, and wherein all procedure information is stored in the same manner as any other information in the system.

3. The system of claim 2, wherein the system includes a set of pre-defined procedures, the predefined procedures including:

a) a Locate procedure for locating data within a data structure,

b) a Delete procedure for deleting data within a data structure,

c) a Precede procedure for adding data to a data structure,

d) an Iteration procedure for iteratively executing a portion of a procedure, and

e) an Enumeration procedure for executing one of a plurality of enumerated alternatives.

4. The system of claim 3, wherein the system further comprises:

a) an Invoke procedure, for executing a Context,

b) an Accept Argument procedure, for enabling a Context to receive data, and

c) a Return Argument procedure, for enabling a Context to transmit data to another Context.

5. The system of claim 2, wherein the information stored in the system is stored within a plurality of directories defined by a user.

6. The system of claim 2, wherein the computer itself comprises means defining said identifiers and said pointers.

7. The system of claim 2, wherein said pointers are created through a program operated by the computer.

8. The system of claim 2, wherein there are at least two Contexts, and wherein the computer includes at least two, processors, arranged to operate in parallel, and wherein different processors are assigned to execute different Contexts.

9. The system of claim 1, wherein the information is arranged in a plurality of boxes, wherein a box may be connected to other boxes, wherein a given box may be assigned one or more "child boxes", the computer being programmed to display the contents of a single given box, the computer being further programmed to display the child boxes of a given box, the computer being programmed to continue to display, when requested by a user, the child boxes, if any, of the box being currently displayed.

10. The system of claim 1, wherein wherein the information is arranged in a plurality of boxes, wherein a box may be connected to other boxes, wherein a given box may be assigned one or more "child boxes", said given box being called an "owner box", the computer being programmed to represent the boxes in outline format, wherein the child boxes of a given owner box are listed in an indented column relative to the owner box.

11. A method of storing information in a computer, the computer having a memory, the method comprising the steps of:

a) defining a plurality of nodes stored in the memory of the computer, each node having a unique identifier within the memory,

b) accepting at least one item of information from a user, and

c) storing within each node at least one pointer, each pointer comprising only an identifier of another node, wherein each node contains no application data elements other than said pointers,

wherein the information to be stored is stored only as a pattern of said pointers.

12. The method of claim 11, wherein the information being stored includes both data and procedure information, and wherein data and procedure are arranged in a structure called a Context, wherein every Context contains both data and procedure, and wherein all procedure information is stored in the same manner as any other information in the computer memory.

13. The method of claim 12, further comprising the step of providing a set of predefined procedures, the predefined procedures including:

a) a Locate procedure for locating data within a data structure,

b) a Delete procedure for deleting data within a data structure,

c) a Precede procedure for adding data to a data structure,

d) an Iteration procedure for iteratively executing a portion of a procedure, and

e) an Enumeration procedure for executing one of a plurality of enumerated alternatives.

14. The method of claim 12, wherein the information stored in the system is stored within a plurality of directories defined by a user.

15. The method of claim 12, wherein the computer intrinsically comprises means for performing the pointer storing step.

16. The method of claim 12, wherein the computer executes software which is loaded into the memory of the computer, the software comprising means for performing the step of storing the pointers.

17. The method of claim 12, wherein there are at least two Contexts, and wherein the computer includes at least two processors, arranged to operate in parallel, and wherein different processors are assigned to execute different Contexts.

18. The method of claim 11, wherein the information is arranged in a plurality of boxes, wherein a box may be connected to other boxes, wherein a given box may be assigned one or more "child boxes", the method further comprising the steps of displaying the contents of a single given box, upon request of a user, and displaying the child boxes of a given box, upon request of the user, and continuing to display, when requested by the user, the child boxes, if any, of the box being currently displayed.

19. The method of claim 11, wherein wherein the information is arranged in a plurality of boxes, wherein a box may be connected to other boxes, wherein a given box may be assigned one or more "child boxes", said given box being called an "owner box", the method further comprising the step of representing the boxes in outline format, wherein the child boxes of a given owner box are listed in an indented column relative to the owner box.

20. An interface device for storing information in a computer, the computer having a memory, the memory comprising a plurality of nodes, each node having a unique identifier within the memory, the interface device comprising means for receiving information from a user and means for storing information in the memory of the computer, the information storing means comprising means for converting information received from the user into a pattern of pointers stored in the memory, each pointer being stored in a node and comprising only the identifier of another node, wherein each node contains no application data elements other than pointers, wherein the information stored by the storing means is stored only as a pattern of said pointers.

21. An interface device for retrieving information stored in a computer, the computer having a memory, the memory comprising a plurality of nodes, each node having a unique identifier within the memory, the information being stored in the memory of the computer only as a pattern of pointers, each pointer being stored in a node and comprising only the identifier of another node, each node containing no application data elements other than pointers, the interface device comprising means for interpreting said pattern of pointers and for converting said pattern into information recognizable by a user.