Friday, October 01, 2004
Toward widely deployable Semantic Web P2P: tools, definitions and the RDFGrowth algorithm
Toward widely deployable Semantic Web P2P: tools, definitions and the RDFGrowth algorithm
"Abstract
There are a number of reasons why user scalability is inherently difficult for Semantic Web P2P scenarios. Approaches distributing queries or data can easily allow any user to consume arbitrary amounts of common resources in terms of computational burden and network traffic respectively. In this paper we illustrate these shortcomings and introduce RDFGrowth, 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 highly replicated, the algorithm opens the way to real world “napster like” P2P SW applications. In describing RDFGrowth, we furthermore provide formal definitions of general applicability when RDF subgraphs are exchanged or signed."
"Abstract
There are a number of reasons why user scalability is inherently difficult for Semantic Web P2P scenarios. Approaches distributing queries or data can easily allow any user to consume arbitrary amounts of common resources in terms of computational burden and network traffic respectively. In this paper we illustrate these shortcomings and introduce RDFGrowth, 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 highly replicated, the algorithm opens the way to real world “napster like” P2P SW applications. In describing RDFGrowth, we furthermore provide formal definitions of general applicability when RDF subgraphs are exchanged or signed."
0 Comments:
