Dear list,
i don't know if this is a good place for Btree questions, but if anybody of you knows a better place, a mailing list, use group etc, please tell me
i have implemented a B+tree library for a small database. it's my spare time hobby. It works quite well, but i want to add additional features. two of them are duplicate keys and variable size key length.
and so far i haven't found information about how to implement them. i have some ideas, but they are not always efficient.
therefore, if anybody knows about a paper or a web page which discusses these questions, i'm very grateful.
Thanks,
Chris