RDFGrowth and the Dbin Project

There are a number of reasons why user scalability is inherently difficult for Semantic Web P2P scenar- ios. Approaches distributing queries or data can easily allow any user to consume arbitrary amounts of common resources in terms of computational bur- den and network traffic respectively. In this paper we illustrate these shortcomings and introduce RDF- Growth, an incremental RDF annotation exchange model and algorithm in an effort to overcome them. RDFGrowth is based on growing the local peer database using only basic direct P2P queries. As these require only minimal and bounded remote computational resources and as information is high- ly replicated, the algorithm opens the way to real world "napster like" P2P SW applications. In de- scribing RDFGrowth, we furthermore provide for- mal definitions of general applicability when RDF subgraphs are exchanged or signed.