Large scale arbitrary search with rendezvous search systems - Springer

摘要

As distributed systems are getting larger and more complex, search facilities for finding data and services within the system become crucial. Users expect search engines to deal with complex query languages like keyword search, SQL, or XPath. At the same time, application developers cannot be expected to come up with distributed versions of those query languages from scratch. Rendezvous search systems are a scalable solution to this problem. By separating the query processing from the network communication, existing libraries for query processing can be easily reused. Rendezvous search systems have been successfully deployed in data center environments like the Google web search engine and are a popular research area for arbitrary search in peer-to-peer environments. Due to the decentralized nature of peer-to-peer systems, a high degree of self-organization and self-optimization can be found in such solutions.