Speed

Despite the complexity of advanced string matching algorithms like Levenshtein, Matchmaker's round trip query time is a few milliseconds. Such speed can be achieved easily with many millions of complex data records. A dual-CPU server with less than 2 Gigs of RAM can easily handle up to 600 queries per seconds over 30 million records with up to 10 or 15 fields of name and address data for instance. All index data is held in a memory efficient proprietary indexing format requiring much less space than the original database did.

Queries in Real-Time

MatchMaker offers error tolerant search algorithms optimized to be up to 100 times faster than other search engines. This unique capability results from a very efficient hardware utilization. The data format is also optimized which increases the speed significantly. This improvement in processing speed is nearly independent of the operating system and the compiler used.

With the advent of 64 bit systems, index size restrictions are also a thing of the past when you use MatchMaker.

More on MatchMaker's support of 64-bit architectures