Ting Quing Zhao

US Patent:

7228437, Jun 5, 2007

Filed:

Jun 19, 2001

Appl. No.:

09/884618

Inventors:

Richard L. Spagna - Boca Raton FL, US
Ting Zhao - Coral Springs FL, US
Douglas R. Geisler - Boca Raton FL, US
James C. Mahlbacher - Lake Worth FL, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/14
G06F 17/30
H04L 9/00
H04N 7/167

US Classification:

713193, 713165, 713194, 726 26, 380228

Abstract:

A method and system for forming a data table in memory on an end user system. The data table forming a library index of storage locations to electronic digital content in memory. The method consists of retrieving an encrypted file from storage. The file has a beginning, an end and a trailer section located just prior to the end. The file is read from the end a predetermined distance to verify if an identifier is present. Reading and decrypting the trailer section from the file read. Determining if there are any updates in the trailer section. In the case there are no updates in the trailer section then decrypting the reference table containing one or more data table location indicators for data items with the first decrypting key. Next, decrypting one or data items with the first decrypting key. Populating the data table with data items at locations specified in the reference table.

US Patent:

7613701, Nov 3, 2009

Filed:

Dec 22, 2004

Appl. No.:

11/021689

Inventors:

Ting Zhao - Coral Springs FL, US
Kenneth L. Milsted - Boynton Beach FL, US
Kenneth Carlin Nelson - Hollister CA, US
Christopher T. Lehman - Delray Beach FL, US
Qing Lu - Coral Springs FL, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00

US Classification:

707 9, 707 10, 707101, 707102, 713166, 713167, 713176

Abstract:

A computer-based method with multilevel hashing for lookup of a complex nested object (such as access control list) which has a plurality of nesting levels and each level has at least one element. Method stores representatives of a complex nested object in a data structure at locations determined by recursive multilevel hashing of the complex nested object elements. When needed, a match for an inputted complex nested object is determined by applying the same recursive multilevel hashing to the inputted complex nested object, as used during the storing of the complex nested object, and performing integer comparisons with hash values of the stored complex nested object.