253 |
-How CAs' data should be saved ? |
-How CAs' data should be saved ? |
254 |
|
|
255 |
2.2.5. Answers to research problem |
2.2.5. Answers to research problem |
256 |
-compared to previous research problem, the benefits of DHTs and SWNs in this research problem are smaller |
-compared to previous research problem, the "first seen" benefits of DHTs and SWNs in this research problem are smaller |
257 |
-we don't know which block is the most recent associated with a specfic urn-5 name |
-we don't know which block is the most recent associated with a specfic urn-5 name |
258 |
-in theory, though, the most efficient algorithm is O(log n), *assuming* that we already know the most recent block's ID (see previos research problem) |
-in theory, though, the most efficient algorithm is O(log n), *assuming* that we already know the most recent block's ID (see previos research problem) |
259 |
-currently, there is no "out-of-the-box" answer to this research problem |
-currently, there is no "out-of-the-box" answer to this research problem |