Changes To Application Example: Distributed Search Engine
Not logged in

Changes to "Application Example: Distributed Search Engine" between 2016-09-03 02:02:24 and 2016-09-03 02:03:05

     1      1   <p><br>
     2      2   </p>
     3      3   
     4      4   <h1>The Gist of the Idea</h1>
     5      5   
     6      6   <p>A document or part of a document resides at a Silktorrent packet. A search
     7      7   query calculates a rational number, a distance, between the query and the
     8         -Silktorrent packet. The to the network of nodes is: <b>"Do You have a
            8  +Silktorrent packet. The question to the network of nodes is: <b>"Do You have a
     9      9   Silktorrent packet that has a MAXIMUM distance of L from the point that is
    10     10   determined by a search-engine specific, pre-defined, function with the
    11     11   following input parameters, param_1,...,param_N?" </b>Some of the nodes on the
    12     12   network will lie, but the only possible, specified, answers to that question
    13     13   are:<br>
    14     14   </p>
    15     15   
    16     16   <p><br>
    17     17   </p>
    18     18   
    19         -<p>
           19  +<p></p>
    20     20   <ul>
    21     21   <li>I do not have it, nor was I able to reach anybody within N hops, who has
    22     22   it.</li>
    23     23   <li>I have it, the Silktorrent packet name is foo and the distance is bar.</li>
    24     24   <li>I do not have it, but ask from node N_x1. Either the N_x1 has it or it can
    25     25   refer to some other node that either has it itself or can give a new node name.
    26     26   The Silktorrent packet name is foo and the distance is bar.</li>
    27         -</ul></p>
           27  +</ul>
           28  +
           29  +<p></p>
    28     30   
    29     31   <p>Each node maintains its own, personal, table of node reputations. The query
    30     32   initiator asks the packet owner directly for the packet and verifies that the
    31     33   promised distance between the query and the packet match. In terms of search
    32     34   hops the nodes closer to the liar get higher penalty points than the nodes
    33     35   further from the liar. The rest is a matter of custom heuristics that can be
    34     36   very creative.</p>