What is ....

Ben Duncan bns
Thu Feb 9 09:21:26 PST 2006


Ok, thanks everyone. The reason I asked is DBM stuff I am
copying from, often to refer to bit-mappin' the index (WTFIT?) and
using a bit-map for telling what "fields" are indices.

I can see the usage from when disk space was a premium (Kinda like the
old COMP-3 stuff in Cobol), but as another question:

Now that we have HUGE disk drives, would it not be as feasible to simply
use short unsigned int in an array configuration to do the same?

I am just looking to figure out the best way to:

A; Keep the code base maintainable by all walks of programming
    Life Forms ( ;-> )
B: Make it efficient and reasonably fast
C: Apply the K.I.S.S. principal ...


I already know that the SLAG DBM engine is going to have to be
a B+tree ISAM type database, that it will have a limit of 32
possible key fields per datafile  - One master, the rest secondary,
( If one needs MORE the 32, it is time to implement some sort of
SQL !!! ), be of a multivalue , variable length record style.


As Always:
Any Comments, suggestions, critique are always welcome and
sometimes appreciated ;-)

Thanks ...

Roger Oberholtzer wrote:
Kurt Wall wrote:

And others wrote:

<SNIP>

-- 
Ben Duncan   - VersAccounting Software LLC 336 Elton Road  Jackson MS, 39212
"Never attribute to malice, that which can be adequately explained by stupidity"
        - Hanlon's Razor



More information about the Linux-users mailing list