The application is reading figerprints from a network device. The fingerprint comes in the form of a 1024 string. When the user puts there fingerprint on the device I need to lookup to see if they have access or not. The problem is speed. When a client buys one of these devices they want access quickly. Well VFP can deliver the speed part, but only if it is indexed. I really don't want to search a memo for the exact match, plus I would have to buy a 3rd party tool to index memos. So I am looking for a way of storing them in a "standard" table using "standard" index approach. The problem here is this is not really a standard approach.

As I was typing this in I thought I could compress the string. 2 problems with that idea. Now I have the overhead of the compression program, and the other problem is it might not compress at all which I have to be able to store worse case scenerio.

Does this help explain the problem?

Thanks,
Dale