I made a big TCS discovery. I want you to write the algorithm in details and calculate compexity

I want a full-featured complete TCS research article implementing my algorithm idea (and calculating its complexity). I think, it will be just about 3 pages. If you even publish it (under my name, not yours), I may pay a little more. So, I invented a data structure and algorithm to copy objects of any size in zero time (well, apparently logarithm of the number of the object in the "store" or "filesystem"). The algorithm idea is described in a comment of this page: [login to view URL] It is OK just to refer to standard algorithms when used as subroutines rather than to write them down, but I want you to refer to publicly accessible information about "subroutine" algorithms, not paywalled information. The thing about quick retrieval of a column from an SQL index is implemented for example in MySQL (it can use B-tree). Be warned, I am not going to pay much. Oh, if you nominate me to some computer science prize, I can pay much more!