maripsa has 0 private notes and 1 public note for this article.
In this paper, we present a scalable Peer-to-Peer RDF repository, named RDFPeers, which stores each triple in a multi-attribute addressable network by applying globally known hash functions. Queries can be efficiently routed to the nodes that store matching triples. RDFPeers also supports users to selectively subscribe to RDF content. In RDFPeers, both the neighbors per node and the routing hops for triple insertion, most query resolution and triple subscription are logarithmic to the network size. Our experiments with real-world RDF data demonstrated that the triple-storing load among nodes in RDFPeers differs by less than an order of magnitude.
maripsa (public note) - 2005-02-11 04:23:16