Fig. 2
From: A collaborative service resource evaluation model based on trust network
Two level hash table of LVR. LVR adopts a second-level data structure. Hash the service IDS according to the size of the hash table as the first-level hash and then establish the second-level index according to the service IDS after the data items are read. The left side is the hash of the confirmed evaluation, and the right side is the hash of the unconfirmed evaluation. Unevaluated hash retains the ID of the evaluated node according to the evaluated value