Christopher W Preston

US Patent:

58939113, Apr 13, 1999

Filed:

Apr 17, 1996

Appl. No.:

8/634024

Inventors:

Harold Aron Piskiel - Manalapan NJ
Mitchell Scott Krieger - Woodmere NY
Benjamin Chien-Wen Lee - Bayside NY
Christopher Blair Preston - Englewood CO

Assignee:

Neon Software, Inc. - Englewood CO

International Classification:

G06F 1730

US Classification:

707 10

Abstract:

Methods and associated structures for rapidly processing messages in a distributed computing application. Rules are stored in structures defined by the present invention and methods associated therewith rapidly process the boolean predicates of the rules to determine what actions need be taken in the distributed computing environment in response to receipt of a message published by a publishing application in the distributed computing environment. Rules argument tables store rule argument entries which each represent a single boolean predicate test clause which compare a column (field) of a published message with either a fixed value or with another column of a published message. All rule argument predicate clauses which are AND'ed to form a rule are related in the rules argument tables by a common rule. sub. -- id column value. An operations table stores entries each of which describes groups of attributes of rules stored in the rules argument tables.

US Patent:

61015563, Aug 8, 2000

Filed:

Jan 7, 1997

Appl. No.:

8/779595

Inventors:

Harold Aron Piskiel - Manalapan NJ
John Arthur Carter - Beverly MA
Christopher Blair Preston - Englewood CO

Assignee:

New Era of Networks, Inc. - Englewood CO

International Classification:

G06F 900

US Classification:

709313

Abstract:

A method and associated structures for dynamically reformatting messages in a distributed computing environment based upon message content as represented by a description of the input message format and the output message format. An input message received by the formatter of the present invention is decomposed into a canonical format stored by the formatter for further use in a rapidly searchable data structure (FGA). The input message data is decomposed in accordance with an input message format description which describes the content of the input message in terms of atomic data types and structures. An output message is then generated in response to a user request and in accordance with a user provided output message format description. The output message format description describes the content of the output format in terms of atomic data types and attributes as well as functional operations performed to derive the output field value. Related fields in an input message format, an output message format, and in the FGA are correlated by a common ID value associated with each field.