Hi Guy.

>Because of an earlier post, I bumped across Calvin's site discussing the phone number challenge. See ...
>
> http://www.calvinhsia.com/default.asp?Page=Phone
>
>There he talks about his VFP implementation of that challenge, but he also mentions that he got 225,000 words into a 679k DLL.
>
>I'm wondering if that compression technique might be connected to the new BINARY Index in VFP 9.0?

Binary indexes have limitations that may make your idea impractical: they're only for logical expressions (not binary values as I suspect you're thinking of) and you can't SET ORDER TO or SEEK on them. They're really only there for Rushmore optimization on expressions like DELETED().

Doug