In order for the semantic search algorithm to work the Domain Tree and Peers Queue need to be constantly updated. This is done when a query request returns a result. This result needs to be checked for duplicates and then all peers and their known paths are inserted into the Peers Queue and Domain Tree.
Optimization: When adding paths clean up any peers which exist multiple times along the same path.
In order for the semantic search algorithm to work the Domain Tree and Peers Queue need to be constantly updated. This is done when a query request returns a result. This result needs to be checked for duplicates and then all peers and their known paths are inserted into the Peers Queue and Domain Tree.
Optimization: When adding paths clean up any peers which exist multiple times along the same path.