Topic: bw-tree - As at division we transfer keys to the new?
Bw-tree Is such piece: it is invented in microsoft in 2013. https://www.microsoft.com/en-us/researc ree-for... The Question about division . Is P which shares. At division P, we create new Q, there we merge from P all keys> = kkk (a dividing key). Q it is generated and there comes time moment (1). Further we climb in P to add delta-redirect-kkk-to-Q. It happens at the moment of time (2). Between the moments (1) and (2) other flow was in time in P keys> = kkk. After (2) there is a situation that for> = kkk all walk in Q, and the part of keys> = kkk there is not present. How to be? By search to check both? Still a variant: at setting delta-redirect-kkk-to-Q in P to put this delta through CAS it is not simple concerning current state P, and concerning that state P which was at the moment of the beginning of copying of the data in Q. Then if between (1) and (2) who-from changes P, the delta will not be interposed also we again we launch formation Q anew. But here risk: If actively flow INSERT in P state P will be constant new and the cycle of attempts of formation Q will do iterations. Dug out pair of projects students with attempts it bw-tree, I esteem source codes even more in detail though they have stubs to addition TODO.