Is there any theoretical information that you are familiar with and that I can have that would explain in a fine detail the implementation of a Btree+ or a Btree* and a good hashing function that goes with it ?. The object is to develop a database scheme in order not to use an existing one. The hashing function must be almost perfect (without collitions)
Work with freelancers specializing in everything from database administration to programming, who have proven themselves as experts in their field. Hire the best, collaborate easily, pay securely, and get projects done right.