System and method for storing and managing functions

• US 5,995,958 A
• Filed: 09/08/1997
• Issued: 11/30/1999
• Est. Priority Date: 03/04/1997
• Status: Expired due to Fees

• Current Assignee: Kevin Houzhi Xu
• Original Assignee: Kevin Houzhi Xu
• Inventors: Xu, Kevin Houzhi
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): MILLS, JOHN G
• Application Number:
  US08/925,847
• Time in Patent Office: 813 Days
• Field of Search: 707/1-205
• US Class Current: 1/1
• CPC Class Codes: G06F 16/212 with details for data modelling support
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

A computer system and method for storing and managing a database that has lambda-definable functions as its foundation. The database is a collection of nodes that are connected by a set of links, and further it is a directed acyclic graph constructed from the nodes and the links. There are two types of links. By ignoring one type of the links, the database can be viewed as a set of trees; and by ignoring another type of the links, the database can be viewed as another set of trees. The directed acyclic graph and the two sets of trees illustrate the dependent relationships among the data and provide means in manipulating the database. A node has a name for the purpose of identification; and a value that carries an unit of meanings of the database application. The value of a node is selected from a regular data type, user-defined data type, and lambda-definable functions. Managing lambda-definable functions allows a database to support infinite data with finite storage. It is proved that a database is an enumeration of the properties of a lambda-definable function; and a lambda-definable function is the abstraction of a database. This gives a database management system the full computing capability that a computer has. Thus a database application doesn'"'"'t need application-dependent software development in host programming languages except for high-level functional specifications, which reduces the development cost of the database application, and improves the reliability and performance of the database application.

Claims

1. A computing apparatus having memory means, comprising a database stored in said memory means, and an interface means interacting with peripheral apparatuses and an implementation means, said database comprising

(I) zero or more nodes, each of said nodes comprising an identifier and a value, said value occupying a piece of said memory means that is selected from a group of data types comprising empty, integers, floating numerical numbers, characters, strings, effectively computable functions, files, multimedia data, and user-defined data.

(II) zero or more number of links selected from a group comprising at least a first link type and a second link type, each of said links having a tail means connecting to a node and a head means connecting to a node, each of said nodes being attached by the head means of zero or more links of the first link type;

being attached by the tail means of zero or one link of the first link type;

being attached by the head means of zero or more links of the second link type; and

being attached by the tail means of zero or one link of the second link type, whereby the nodes and the links of the first link type forms a set of trees; and

the nodes and the links of the second link type forms a set of tree, and whereby the tees reflect dependent relationships among the nodes,

said implementation means comprising a plurity of query procedures selected from a group comprising a query procedure that has a plurity nodes as parameters for retrieving the nodes which depend on the given nodes with respect to the first link type;

a query procedure that has a plurity of nodes as parameters for retrieving the nodes which depend on the given nodes with respect to the second link type;

a query procedure that has a plurity of nodes as parameters for retrieving the nodes which am depended by the given nodes with respect to the fist link type; and

a query procedure that has a plurity of nodes as parameters for retrieving the nodes which are depended by the given nodes with respect to the second link type.

2. The computing apparatus of claim 1 wherein said interface means comprises a procedure that is used to receive data access requests with references to said database from said peripheral apparatuses;

to interact with said implementation means that accesses said database and forms responses satisfying said data access requests; and

to return said responses to said peripheral apparatuses.

3. The computing apparatus of claim 1 wherein said implementation means further comprises a plurity of procedures selected from a group comprising an creation procedure that is used to enter a plurality of new nodes into said database;

a deletion procedure that is used to erase a plurality of nodes that have dependent relationships with a plurity of nodes provided as the parameters of said data access requests, and to erase a plurality of corresponding links from said database; and

an update procedure for updating values of nodes or updating links connecting nodes.

4. The computing apparatus of claim 1 wherein said memory means is either main memories, secondary storages, or peripheral apparatuses.