-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 El Mon, 17 Aug 2009 10:16:08 +0000 Eric MSP Veith <[email protected]> escribió: <...> > The thing with the generic DB is, that, depending on the type of data > storage model we choose, we can get good or bad results depending on > the state of our program. A B-Tree gives us good performance when we > e.g. store services, their states and dependencies in it. Sorting > would rely on a criterium like the dependencies. But if we store > other things in the same DB instance, too, we'll probably make thing > inefficient because we cannot choose a good algorthm for > sorting/insertion.
To clarify the idea, actually there would be #DBs+1 B-trees. A main B-tree would keep all the DBs within a single handler, while mapping the DB-IDs to their respective B-trees. BTW, to order trees, we have no option but to order everything by it's name hash, because we don't know if a dependency applies or not _and_ we must be able to search by name anyway. - -- Ismael Luceno -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAkqJN5EACgkQ/mxY0+yOXJo5yQCeLC+gQm+EnjttkNqeuUR31MTs uf0AoLrXami0mfH/8c6ypeFTK2B4g3ae =ckXD -----END PGP SIGNATURE----- -- _______________________________________________ Initng mailing list [email protected] http://jw.dyndns.org/mailman/listinfo/initng
