We now know that it is feasible to have in-memory timestamps for all graph nodes, although that is not really efficient because we need timestamps only on commits. We want to integrate an efficient equivalent of that to the compression timeline, along the following lines:

• compute an MPH for all revision nodes
• extract all revision timestamps from the DB and store them in a big array sorted by revision MPH