Michael H Forster

US Patent:

6601058, Jul 29, 2003

Filed:

Oct 5, 1998

Appl. No.:

09/166556

Inventors:

Michael Forster - Prairie Village KS 66208
Lindsay Spratt - Lawrence KS 66044

International Classification:

G06F 1730

US Classification:

707 3, 707 2, 707100, 706 46, 706 59

Abstract:

Preferred embodiments of the invention provide a system for, and method of, exploring relationships in data stored in a computer readable medium. A query is received having at least one operator chosen from a set of operators that includes relational operators and having at least one input and output associated with the operator and defined as a table having at least one domain having a type associated therewith. The query is transformed into a set program having at least one operation structure, corresponding to the operator and having logic for type-independently performing an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

US Patent:

20040073546, Apr 15, 2004

Filed:

Jul 29, 2003

Appl. No.:

10/629125

Inventors:

Michael Forster - Prairie Village KS, US
Lindsey Spratt - Lawrence KS, US

Assignee:

Hedron LLC - Overland Park KS

International Classification:

G06F017/30

US Classification:

707/004000

Abstract:

Preferred embodiments of the invention provide a system for, and method of, exploring relationships in data stored in a computer readable medium. A query is received having at least one operator chosen from a set of operators that includes relational operators and having at least one input and output associated with the operator and defined as a table having at least one domain having a type associated therewith. The query is transformed into a set program having at least one operation structure, corresponding to the operator and having logic for type-independently performing an operation, corresponding to the operator, and having a data relation structure, cooperating with the operation structure, for handling all data access and storage associated with the operation.

US Patent:

63275872, Dec 4, 2001

Filed:

Oct 5, 1998

Appl. No.:

9/166441

Inventors:

Michael Forster - Prairie Village KS

Assignee:

Digital Archaeology, Inc. - Lenexa KS

International Classification:

G06F 1730

US Classification:

707 2

Abstract:

Preferred embodiments of the invention provide a system for, and method of, exploring relationships in data stored in a computer readable medium. Under one preferred set of embodiments, sets of data are maintained in a computer readable medium and include at least one intensional expression and one extensional expression of at least one set resulting from an evaluation of a first query. A second query is transformed into a set program. It is then determined whether a sub-expression of the set program is satisfied by a maintained set. If so, the sub-expression is removed from the set program and the maintained set that satisfies the sub-expression of the set program is used. Under another preferred set of embodiments, a query is received having at least one operator chosen from a set of operators that includes relational operators and having at least one input and output associated with the operator and defined as a table having at least one domain having a type associated therewith. The query is transformed into a set program having at least one operation structure, corresponding to the operator. An execution context is then analyzed to automatically select an operation structure from a set of operation structures corresponding to the operator so that the selected operation structure may be included in the set program.