US 6,643,638 B1Granted

System and method for storing and computing data and functions

OwnerKevin Houzhi Xuinventor

Life of this patent

Estimating the term…

Loading patent…

Abstract

A computer system and method is to store and manage data and to construct application programs. This system accepts uniform input expressions db-terms, by which the stored data can be referenced and user queries can be expressed. A database is a collection of nodes that are connected by a set of directed links. There are three types of links. By ignoring one type of the links, the database can be viewed as a set of trees. All the nodes in databases are viewed as functions; all the db-terms can be computed to their values if they existed against databases and according to computing rules. The tree structures embedded in databases illustrate the dependent relationships among the data, and provide build-in functions in manipulating the database and a theoretical guideline of data distribution. The function-argument-value relationships among the nodes in databases provide a theoretical guideline for a set of useful built-in functions.

Claims4

Dependent claims

An apparatus having input/output means;

memory means;
and CPU means, comprises a database with a plurality of nodes;
a plurality of up-down links;
a plurality of dash arrows;
a plurality of solid arrows, each of said up-down links being a means supported by said memory that has an up end connecting to a node selected from said nodes and a down end connecting another node selected from said nodes, each of said dash arrows being a means supported by said memory that has a tail connecting to a node selected from said nodes and a head connecting another node selected from said nodes, each of said solid arrows being a means supported by said memory that has a tail connecting to a node selected from said nodes and a head connecting another node selected from said nodes, each of said nodes being connected by the up ends of zero or more links selected from said up-down links;
being connected by the down end of zero or one link selected from said up-down links;
being connected by the heads of zero or more arrows selected from said dash arrows;
being connected by the heads of zero or more arrows selected from said solid arrows, each of the nodes (or the root nodes) which are not connected by the down ends of a plurality of links selected from said up-down links having a label, and each of the nodes (or the non-root nodes) which are connected by the down end of exactly one link selected from said up-down links being connected by the tail of exactly one arrow selected from said dash arrows;
and a receptionist which accepts requests from other apparatus or users, and converts said requests to db-terms.

6 more elements

Dependencies are inferred from the claim text.