I’m currently thinking about syndicated search for ISS. A search that is totally decentralized and served by friends (and friends of friends) for an extended period of time. This is the basic workflow:
- Each individual generates a social graph beforehand consulting the cascading taglinks;
- A query can be sent to friends up to x degrees apart, where x is define by the user;
- This query is published on the users’ searched node with an ID and a TTL;
- Friends may accept the query and see if they have entries that match. If so, they send the IDs of the matched entries and publish that to their matched node. The query is kept alive until the TTL expires or according to the policies;
- Users receive the matched entries in their aggregator. These appear associated with the original query and separated from the main flow of the aggregator.
Further Reading:
- OpenSearch, (2008);
- XEP-0055: Jabber Search, (2008);
- JQbus: social graph query with XMPP/SPARQL, Dan Brickley, (2008);
- Decentralized Meta-Data Strategies: Effective Peer-to-Peer Search, , IEICE Transactions on Communications, Volume E86-B, Number 6, p.1740-1753, (2003);
- Looking up data in P2P systems, , Commun. ACM, Volume 46, Number 2, New York, NY, USA, p.43–48, (2003);
- Designing Semantic Publish/Subscribe Networks using Super-Peers, , Semantic Web and Peer-to-Peer, December, (2005);
- EDUTELLA: a P2P networking infrastructure based on RDF, , WWW ‘02: Proceedings of the 11th international conference on World Wide Web, New York, NY, USA, p.604–615, (2002);
- The anatomy of a large-scale hypertextual Web search engine, , Computer Networks and ISDN Systems, Volume 30, Number 1–7, p.107–117, (1998);
- The PageRank Citation Ranking: Bringing Order to the Web, , (1998).
