The Ultimate High-Capacity-Toolkit for Quick Searching and Finding

Xfinder++ is used, when a quick indexed search after words or word fragments in databases is required. Examples are extensive data quantities (items, regular customers) where conventional search systems are not able to find satisfactory results about article number and search key. The system of fragmental search is comparable with a full-text-database in which a data record is found by inputting optional parts of words. It stands to reason that the use of conventional Database-Toolkits which usually work with tree-structures (like BTree(+)) when inferior figures of data records are needed, the corresponding data records at such a big quantity of data would take gigantic dimensions.

Therefore Xfinder++ falls back on an own data control that was especially developed for this mode of application, which renders optimal data density and quickest access enable to the wanted data. Therefore all to speed relevant program parts were written in Assembler.

Seek and you'll find
(Unfortunately not always)

The locating of data records at interrogations, modifications, offers or accounts is entailed with high delays quite often.

Xfinder++ is considerably faster

Through any input of partial information or word fragments you will find your data easier and faster with Xfinder++.

You are searching...

...a special data record in an extensive customer database. You only have to enter one or several fragments of the wanted data record. For example:

... Xfinder++ is finding!

Xfinder++ scrutinizes in fractions of a second in which data records the entered fragments are found and shows these data records for selection.

Two parts to the Xfinder++ Program

1. Index Build:
   This part of program is responsible for the architecture of index file. It generates from the respective data file an independent index respectively fragment file that allows the second part of program searching for word fragments etc.
2. Fragmental Search:
   That part of program is responsible for the real search. After entering of a search key the primary keys respectively set numbers of found hits (data records) are known by the system in fractions of a second. Then the found primary keys can be handled individually by the software developer.

Marks of Power

• Xfinder++ can optimally be used with Xbase++ through a especially for Xbase++ created API. An integration of Xfinder++ in Xbase++ programs is possible in really short time. Xbase++ commands are extended with Xfinder++ commands. The programmer has no need to learn new commands.
• A boundless number of word fragments in any length are taken into consideration (for example, counter sunk SCREW M 12 mm)
• Usability--Simple input of search keys without using control instructions, wildcards, etc.
• Boundless number of indexed data records
• Networkability
• Extremely fast indexing (1 million data records on a pentium system in about 15 minutes)
• High compression of the Xfinder++ index file
• Individual influence of index architecture and search with several parameter
• Searching exclusively takes place on hard disk--you don't need extra RAM
• Online-Indexing by new installation, deletion or alteration of data records
• Access to all data only in the Read-Only-Modus