System and method for storing and managing information

• US 5,564,119 A
• Filed: 04/17/1995
• Issued: 10/08/1996
• 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:
  US08/422,912
• Time in Patent Office: 540 Days
• Field of Search: 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. A database management system, comprising an editor, the editor comprising means for creating a plurality of icons and connections between said icons on a display means, the icons and connections being arranged to form a data structure and a procedure structure, the system including computer memory means, operatively connected to the editor, for representing the icons as nodes and the connections between icons as pointers which point from one node to another node, wherein all data and all procedure stored in the system are stored only in the form of patterns of said pointers, the patterns of pointers corresponding to connections between icons shown on the display means.

2. A database management system, comprising:

a) a first network having a plurality of nodes, said first network having lines connecting at least some of the nodes, said first network representing data to be stored in the system,

b) a second network having a plurality of nodes, said second network having lines connecting at least some of the nodes, the second network representing procedure used to operate on data stored in the system, and

c) an editor program comprising means for creating said nodes and lines of said first and second networks, and for representing the nodes and lines internally in a computer memory,

d) the system being programmed to enter data by making a duplicate of said first network, the duplicate network having nodes and lines, and by establishing connections between the nodes of said duplicate network, the latter connections being the sole representation of data entered into the system.

3. A method of managing data stored within a memory of a computer, the method comprising the steps of:

a) operating an editor to create a first network of nodes and lines, the lines connecting at least some of the nodes, the first network representing data to be managed,

b) operating the editor to create a second network of nodes and lines, the lines connecting at least some of the nodes, the second network representing procedure used to operate on the data, and

c) executing the procedure represented by the second network, wherein all entry of data is performed solely by making a duplicate network corresponding to the first network, and establishing connections between the nodes of the duplicate network, the establishment of the latter connections being the sole method of entering the data.

4. The method of claim 3, wherein the procedure network includes at least one pre-defined procedure which can be executed, the procedure network connecting various pre-defined procedures in a particular order, and wherein the execution step comprises the step of traversing the entire second network, so as to execute the various pre-defined procedures in said order.

5. The method of claim 4, wherein the connection-establishing of step (c) comprises the step of assigning a number to at least one pointer within a discrete unit of memory within the computer, the discrete unit within the computer memory being called a Brick, and wherein the number assigned to the Brick enables the Brick to "point" to another Brick.