oreilly.comSafari Books Online.Conferences.
Articles Radar Books  

P2P Memebag

Sorted network

Ordering (or sorting) a collection of datums is one of the most common operations in computer science, because it can greatly increase the utility of the collection. In fact there are many uses of a collection of datums that are impossible if the data is not sorted. In that networks are a collection of special purpose datums called nodes, sorting the nodes can greatly increase the utility of a network. This is far more difficult with nodes than other data types because the nodes themselves may well not be interested in being sorted. The Yoid project (www.aciri.org/yoid ) is an example of a sorted network, as is Freenet. Freenet is considered sortable but not searchable, while Gnutella is considered searchable but not sortable

Back to Index


P2P Weblogs

Richard Koman Richard Koman's Weblog
Supreme Court Decides Unanimously Against Grokster
Updating as we go. Supremes have ruled 9-0 in favor of the studios in MGM v Grokster. But does the decision have wider import? Is it a death knell for tech? It's starting to look like the answer is no. (Jun 27, 2005)

> More from O'Reilly Developer Weblogs


More Weblogs
FolderShare remote computer search: better privacy than Google Desktop? [Sid Steward]

Data Condoms: Solutions for Private, Remote Search Indexes [Sid Steward]

Behold! Google the darknet/p2p search engine! [Sid Steward]

Open Source & The Fallacy Of Composition [Spencer Critchley]