3 ms·
Seems like it could be generalizable to tree-based indexing. The Tom Cruise node is the higher node, and the Pfeiffer node is a lower node. If you're first se
by vimax 3y ago
Seems like it could be generalizable to tree-based indexing.
The Tom Cruise node is the higher node, and the Pfeiffer node is a lower node. If you're first searching for Tom Cruise, you would find it earlier.
With the Pfeiffer search, you have a lot more space to search before you get the node.
With bounded computation, you may not be able to reach the lower node.
- mdp2021 3y agoOntologies in natural implementations are redundant. (Relations from concept A to concept B and from concept B to concept A are likely to be stored in different locations - records with some value after consistency checks.)
- vimax 3y agoYes, but if we want to compress the size of a single implementation, it'll start looking like Huffman encoding where Tom Cruise is encoded with fewer bits (higher in the tree) than Pfieffer.