BBSysco development log  Business Basic Systems Corporation

Have spent some time designing the internal layouts of a memory file equivalent for MSB.  Historically I have implemented these as binary searches on a sorted list of records.  While this provides for fast look-ups, WRITE require the list to be shuffled in order to add/remove entries from the list and this can be a fairly large overhead for large memory files.

What I think I’m going to do for MSB is implement the memory files as “symmetric binary trees” using the generic red-black algorithm which should provide for optimum access time while reducing the insertion/removal overhead.  I had considered a splay tree algorithm which works well if the data is being recalled often as it sorts the tree based on most recent access — however I think the red-black algorithm will be better.

I also will likely use this for ”string” based array sub-scripting that I am considering adding to MSB.  Although in this case a Splay tree might be better.