Paper Info
Title
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
Abstract
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P appli- cations. In this scenario, peers perform browsing and querying of semantic web statements on a local database without directly generating network traffic or re- mote query execution. The database grows by learning from other peers in the P2P group using only a minimal amount of direct queries that are guaranteed to be executable with a low, predictable computational cost. Although full RDF graphs could be treated, the design allows a peer to learn only about resources considered interesting by a specific "community" and makes it possible to tag the received information according to individual trust rules. Inspired by well known viral distributed information techniques, the algorithm is in agreement with the RDF semantics and is specifically suited for the properties of Distributed Hash Table P2P networks. A few assessments about the applicability of RDFGrowth to real semantic web applications are also given.
Year
Venue
Keywords
2004
P2PKM
distributed hash table,semantic web,computer science,p2p
Field
DocType
Citations 
Metadata,Semantic Web Stack,Computer science,Data Web,Semantic Web,Algorithm,Semantic analytics,Social Semantic Web,RDF,Distributed hash table
Conference
19
PageRank 
References 
Authors
2.27
6
5
Name
Order
Citations
PageRank
Giovanni Tummarello11106104.63
Christian Morbidoni228937.76
Joackin Petersson3192.27
Paolo Puliti49015.24
Francesco Piazza5673100.48