tron1@tronsbox.xei.com (Kenneth Jamieson) (03/31/91)
Hi there in net land! I am cross-posting this origional, but the followup line should be right so try not to flame me too badly. I am looking to do a "look see" database, something that will be resonable useful for most situations, and simple enough to understand. With the wide range of experience on the net, I wnat to ask you all. What I have now is a VERY simple DB structure, in this form: Index Data =============================================================== KEY ---> KEY OFFSET ------------------------/ SIZE DATA The index will be read into memory, as you can see, the DB handles variable length records. When a record is deleted, I will set the key to -1 and delete it's index. I will ignore the holes this will leave in the db file for now. Sorting the index is not needed, it will be in a hash table in memory. That doesnt matter much, I am looking at more general theory now. What other ways are there to do this ? Please reply by mail and I will summarize, or followup. Thanks! -- ========[ Xanadu Enterprises Inc. Amiga & Unix Software Development]======= = "I know how you feel, you don't know if you want to hit me or kiss me - = = --- I get a lot of that." Madonna as Breathless Mahoney (Dick Tracy) = =========== Ken Jamieson: uunet!tronsbox.xei.com!tron1 =================== = NONE of the opinions represented here are endorsed by anybody. = === The Romantic Encounters BBS 201-759-8450(PEP) / 201-759-8568(2400) ====