Update of "Application Example: Distributed Search Engine"
Not logged in

Artifact ID: 467c1409174985847eb0c3124a0e2358dddb4e75
Page Name:Application Example: Distributed Search Engine
Date: 2016-11-27 12:04:41
Original User: martin_vahi
Parent: e2c50d68c6b0ebb166af8f13ee485ec181f9e676 (diff)
Next 8f11a0c266d90b05a38e2cbde70fbbc2ad0699c3

The idea in this chapter has not been tested in practice yet. It's just a thought, a starting point for an experiment.

The Gist of the Idea

A document or part of a document resides at a Silktorrent packet. A search query calculates a rational number, a distance, between the query and the Silktorrent packet. The question to the network of nodes is: "Do You have a Silktorrent packet that has a MAXIMUM distance of L from the point that is determined by a search-engine specific, pre-defined, function with the following input parameters, param_1,...,param_N?" Some of the nodes on the network will lie, but the only possible, specified, answers to that question are:

Each node maintains its own, personal, table of node reputations. The query initiator asks the packet owner directly for the packet and verifies that the promised distance between the query and the packet match. In terms of search hops the nodes closer to the liar get higher penalty points than the nodes further from the liar. The rest is a matter of custom heuristics that can be very creative. The liars might lie only occasionally, at random moments or according to some heuristic or statistical distribution, according to instructions from censors, etc. The search engine might be designed to search for text, but the algorithm works also on other data types, for example, 3D shapes, maps, images, sounds, etc.

Partial list of Sources of Inspiration

Some Related References