re: RUM Conjecture - Reasoning About Data Access VIEW POST

TOP OF THREAD FULL DISCUSSION
re: Hello, Nice post. So you say you are using this formula on your post: UO = (BU + AU) / BU + RO But i do not see it in action. With said formula ...
 

Ok I read the post again and I'm not sure if we have UO = 2 somewhere.

  • In the read optimal case, we do not have any RO associated with an update as we know the position by index without reading the data.
  • In the update optimal case, we also do not have any RO as we simply append to the log.
  • In the memory optimal case we can have UO > N, as we need to perform N reads in case the element to be inserted is not part of the set.

Does it make sense?

 

Hmmm,
For the first case, for us to know the position by index shouldn't need to read the position first ?

For the third case i did not understand what are you saying.

Thanks,

For the first case, for us to know the position by index shouldn't need to read the position first ?

What do you mean by reading the position? We can simple insert or delete the value without knowing whether it was there already.

For the third case i did not understand what are you saying.

What is it that you don't understand?

code of conduct - report abuse