Technology Break Through

Until now no peer-to-peer web search didn’t exist, that could be a serious alternative to the current legacy search engines. The idea was investigated since a couple of years mainly in the academic area and sometimes contradictory findings about the feasibility were obtained as well as first prototypes were built. The necessary combination of scaling of users, documents and words during indexation, ranking and search, as well as Boolean queries, speed, ranking, and completeness of index and results was neither as theoretic concept nor as functional implementation sufficiently solved.

By combining radical new distributed index structures, indexation and search techniques, the usage of recent developments from various fields and their enhancement in many respects we were the first to succeed in developing an integrated conception and implementing it in a working distributed web search engine (p2p web search engine) for the mass market.


Effective Search

  • Supports Boolean queries: AND PHRASE NOT NEAR.
  • Guarantees top-1000 results also for Boolean queries.
  • Guarantees a response time comparable to common search engines.
  • No intersection of posting lists required.
  • Complete results also for rare combinations of frequent words.
  • Incremental search (result 1..10, 11..20).
  • Domain collapsing: only one result per domain / further results of this Domain.

Peer Ranking and Personalization

  • PeerRank: Ranking by a fully automated, anonymized behavior analysis of all users across all visited web pages.
  • PersonalRank:fully automated user preference based ranking: implicit social search without user action or loss of privacy.

Instant and Incremental Crawling

  • Instant indexing, updating and ranking: No crawler required.
  • Incremental indexing, updating and ranking: Deletion and updating are supported.
  • Sparse and traffic saving indexing, updating and ranking.

Loadbalancing and Churn

  • Instant load balancing for sudden query peaks.
  • Persistent information despite churn.

Scaling

  • Organic scaling: Performance and load grows equally with number of users.
  • Scales for a virtually unlimited number of users, documents, words, updates and queries.
  • Scales for frequent words and frequent queries.

Compression and Privacy

  • Highly effective distributed data base compression: similar to jpg, divx,mp3 or mpeg only data relevant to the user are stored.
  • Compressed index and transfer.
  • Encrypted index und encrypted queries for full search privacy.
  • Standard http-protocol, with nat and firewall traversal.

Research & Development

  • 5 years research & development.
  • Using latest academic publications in p2p overlay protocols, synchronization, cryptography, distributed indexes, index compression, distributed queries, stemming, ranking (1500+ papers)
  • 100+ own inventions.