William D Maimone

US Patent:

6418451, Jul 9, 2002

Filed:

Jun 29, 1999

Appl. No.:

09/342663

Inventors:

William D. Maimone - Birdsboro PA

Assignee:

Unisys Corporation - Blue Bell PA

International Classification:

G06F 1700

US Classification:

707200, 707103 R, 707103 Z, 707103 Y, 707 4, 709315

Abstract:

A method, apparatus, and computer program product enable objects of an object-oriented environment to be persisted in a relational database. An object to be persisted first stores its attributes in a property bag. It is then determined whether the schema of the relational database supports the storage of objects of the class of the object to be persisted. If not, the relational database is dynamically reconfigured using commands of a data definition language of the relational database so that the schema supports the storage of objects of that class. This may include the creation of a new table for that class of objects or the modification of an existing table to accommodate new or different attributes of that class. Once any necessary modifications to the database schema have been made, commands of a data manipulation language of the relational database are generated to store in the appropriate table the attributes from the property bag of the object to be persisted.

US Patent:

58931023, Apr 6, 1999

Filed:

Dec 6, 1996

Appl. No.:

8/761252

Inventors:

William D. Maimone - Birdsboro PA
Albert B. Cooper - New York City NY

Assignee:

Unisys Corporation - Blue Bell PA

International Classification:

G06F 1730

US Classification:

707101

Abstract:

Using LZW data compression/decompression processing techniques, textual input data is compressed by parsing consecutive words of the text into phrases and storing the phrases in a dictionary with compressed phrase codes associated therewith. The textual input data is searched by determining the longest match with the stored phrases in the dictionary and the compressed phrase code associated with the longest match is output to a compressed text database and stored at a location thereof. A list of references is maintained associated with each stored phrase to the locations in the compressed text database at which the compressed phrase code for the phrase is stored. Lists of word-to-phrase references are also created providing references for each distinct word encountered in the text to the stored phrases containing the word. Textual queries applied against the compressed text database utilize the dictionary and reference lists to access compressed database references and to decompress text in both directions from a referenced compressed text database location in order to provide information relative to the query.

US Patent:

58648372, Jan 26, 1999

Filed:

Jun 12, 1996

Appl. No.:

8/662305

Inventors:

William D. Maimone - Birdsboro PA

Assignee:

Unisys Corporation - Blue Bell PA

International Classification:

G06F 1730

US Classification:

707 1

Abstract:

Disclosed are a method and system for transferring data objects from a server to a client in a distributed computing system. The disclosed method comprises the steps of: receiving, at the server, a request from the client for the data object; determining whether a cached copy of the requested object retained by the client is the same as a current version of the requested object retained by the server, wherein the cached copy and the current version are stored in a compressed form; and transmitting the current version of the requested object from the server to the client in the compressed form if the cached copy of the requested object is not the same as the current version of the requested object. The step of determining whether a cached copy of the requested object retained by the client is the same as a current version of the requested object comprises comparing a first relatively unique number computed on the basis of the current version of the requested object with a second relatively unique number computed on the basis of the cached copy of the requested object. The cached copy of the requested object is assumed to be the same as the current version of the requested object if the first relatively unique number is equal to the second relatively unique number.