Edgar Hardin Gillock

US Patent:

20060031213, Feb 9, 2006

Filed:

Sep 27, 2005

Appl. No.:

11/235243

Inventors:

James Wilson - Collierville TN, US
Robert Snapp - Memphis TN, US
David Payne - Collierville TN, US
Edgar Gillock - Memphis TN, US

International Classification:

G06F 17/30

US Classification:

707003000

Abstract:

A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on only a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

US Patent:

20060064414, Mar 23, 2006

Filed:

Sep 12, 2005

Appl. No.:

11/223027

Inventors:

Robert Snapp - Memphis TN, US
Michael Garner - Collierville TN, US
Edgar Gillock - Memphis TN, US
James Wilson - Collierville TN, US

International Classification:

G06F 17/30

US Classification:

707004000, 705406000

Abstract:

Systems and methods are provided for determining secondary address information. In one implementation, a method is provided that uses a data processing apparatus. According to the method, a code word is created for a business name and a building default extended delivery code. A data table is searched using the code word and secondary address information is revealed when a match is found between the code word and data stored in the data table.

US Patent:

20070094511, Apr 26, 2007

Filed:

Dec 14, 2006

Appl. No.:

11/638445

Inventors:

James Wilson - Collierville TN, US
Robert Snapp - Memphis TN, US
David Payne - Collierville TN, US
Edgar Gillock - Memphis TN, US

International Classification:

H04L 9/00

US Classification:

713181000

Abstract:

A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

US Patent:

20040049682, Mar 11, 2004

Filed:

Jun 11, 2003

Appl. No.:

10/459013

Inventors:

James Wilson - Collierville TN, US
Robert Snapp - Memphis TN, US
David Payne - Collierville TN, US
Edgar Gillock - Memphis TN, US

International Classification:

H04L009/00

US Classification:

713/181000

Abstract:

A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on only a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.