Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

  • Congratulations Chris Miller on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

B+ tree algorithms for Delphi?

Status
Not open for further replies.

autolab

Programmer
May 23, 2002
4
US
I am creating a Delphi interface to a DOS system still in use and need to be able to read the existing index files. The software documentation says "... uses the b+ tree algorithms with ten keys per node. Key files are defined as primary or secondary. Primary keys must be unique. If you intend to add, delete, or change keys, you should study a good reference source for this information." It goes on to say the header record gives Root Record locaton, Current levels in tree, Key Length, Maximum keys and Maximum levels.
They also include the file/record/field layouts for the various keys.

Apparantly they rolled their own index system instead of using Btrieve or the like(this was written in C around 1984). Any ideas where to start?
 
If you hace C sources you can rewrite them on Delphi.

--- markus
 
Status
Not open for further replies.

Part and Inventory Search

Sponsor

Back
Top