United States Postal Service

Edgar H Gillock, Ii

James DeForrest Wilson

Robert F Snapp

David James Payne

Michael C Garner

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.

Systems and methods for applying secondary information to business addresses

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.

Method and system for efficiently retrieving secured data by securely pre-processing provided access information

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.

Growing community of inventors

Memphis, TN, United States of America

Edgar H Gillock, Ii