A subscribable peer-to-peer RDF repository for distributed metadata management
Journal of Web SemanticsPublished 1 December 2004
Min Cai, Martin Frank, Baoshi Yan, Robert M. MacGregor
Citations81
SJR quartileQ2
SJR score0.64
SNIP1.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
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 enables 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 differs by less than an order of magnitude.
Keywords
Computer Science
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Lecture notes in computer sciencePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
7,296 Citations2001Antony Rowstron, Peter Druschel
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
A scalable content-addressable network
6,407 Citations2001Sylvia Ratnasamy, Paul Francis +3 more
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
2,143 Citations2001Ben Y. Zhao, John Kubiatowicz +1 more
Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Measurement study of peer-to-peer file sharing systems</title>
1,922 Citations2001Stefan Saroiu, Krishna P. Gummadi +1 more
IEEE Journal on Selected Areas in CommunicationsScribe: a large-scale and decentralized application-level multicast infrastructure
1,456 Citations2002Miguel Castro, Peter Druschel +2 more
Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes, and balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast.
ACM Transactions on Computer SystemsDesign and evaluation of a wide-area event notification service
1,424 Citations2001Antonio Carzaniga, David S. Rosenblum +1 more
IEEE Internet ComputingMapping the Gnutella network
766 Citations2002R. Matei, Adriana Iamnitchi +1 more
This work studied the topology and protocols of the public Gnutella network to evaluate costs and benefits of the peer-to-peer (P2P) approach and to investigate possible improvements that would allow better scaling and increased reliability in Gnutsella and similar networks.
EDUTELLA
757 Citations2002Wolfgang Nejdl, Boris Wolf +7 more
The open source project Edutella is discussed, which builds upon metadata standards defined for the WWW and aims to provide an RDF-based metadata infrastructure for P2P applications, building on the recently announced JXTA Framework.
The design philosophy of the DARPA internet protocols
644 Citations1988David D. Clark
This paper attempts to capture some of the early reasoning which shaped the Internet protocols.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
624 Citations2001Ben Y. Zhao, John Kubiatowicz +1 more
IEEE/ACM Transactions on NetworkingAnalyzing Peer-To-Peer Traffic Across Large Networks
587 Citations2004Subhabrata Sen, Jun Wang
The high volume and good stability properties of P2P traffic suggests that the P2P workload is a good candidate for being managed via application-specific layer-3 traffic engineering in an ISP's network.
Lecture notes in computer scienceKoorde: A Simple Degree-Optimal Distributed Hash Table
567 Citations2003M. Frans Kaashoek, David R. Karger
Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2 that meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node.
Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06
530 Citations2006
SC06 will explore the ways in which high performance computing, networking, storage and analysis lead to advances in research, education and commerce, and introduce an initiative focusing on those emerging concepts and technologies that have the potential to reshape the HPC landscape.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
517 Citations2001Ion Stoica, Robert Morris +3 more
Elsevier eBooksQuerying the Internet with PIER
516 Citations2003Ryan Huebsch, Joseph M. Hellerstein +4 more
This paper presents the initial design of PIER, a massively distributed query engine based on overlay networks, which is intended to bring database query processing facilities to new, widely distributed environments.
Peer-to-peer information retrieval using self-organizing semantic overlay networks
489 Citations2003Chunqiang Tang, Zhichen Xu +1 more
Experiments show that pSearch can achieve performance comparable to centralized information retrieval systems by searching only a small number of nodes, and techniques that help distribute the indices more evenly across the nodes are described.
RQL
438 Citations2002Gregory Karvounarakis, Sofia Alexaki +3 more
A new RDF query language called RQL is proposed, which is a typed functional language (a la OQL) and relies on a formal model for directed labeled graphs permitting the interpretation of superimposed resource descriptions by means of one or more RDF schemas.
Lecture notes in computer scienceLoad Balancing in Structured P2P Systems
413 Citations2003Ananth Rao, Karthik Lakshminarayanan +3 more
This paper explores the space of designing load-balancing algorithms that uses the notion of “virtual servers” and presents three schemes that differ primarily in the amount of information used to decide how to re-arrange load.
MAAN: a multi-attribute addressable network for grid information services
394 Citations2004Min Cai, Martin Frank +2 more
Efficient Peer-to-Peer Keyword Searching
388 Citations2007Patrick Reynolds, Amin Vahdat
International Semantic Web ConferenceJena: implementing the RDF model and syntax specification
356 Citations2001Brian McBride
Jena, an RDF API in Java based on an interpretation of the W3C RDF Model and Syntax Specification, is described.
Piazza
353 Citations2003Alon Halevy, Zachary G. Ives +2 more
Piazza offers a language for mediating between data sources on the Semantic Web, which maps both the domain structure and document structure and enables interoperation of XML data with RDF data that is accompanied by rich OWL ontologies.
arXiv (Cornell University)Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
336 Citations2002Matei Ripeanu, Ian Foster +1 more
The Gnutella virtual network topology does not match well the underlying Internet topology, hence leading to ineffective use of the physical networking infrastructure, and changes to the Gnutsella protocol and implementations that may bring significant performance and scalability improvements are proposed.
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
332 Citations2003Wolfgang Nejdl, Martin Wolpers +5 more
These RDF-based P2P networks are able to support sophisticated routing and clustering strategies based on the metadata schemas, attributes and ontologies used, and the use of super-peer based topologies for these networks is described.
Lecture notes in computer scienceRouting Algorithms for DHTs: Some Open Questions
292 Citations2002Sylvia Ratnasamy, Ion Stoica +1 more
Even though they were introduced only a few years ago, peer-to-peer (P2P) filesharing systems are now one of the most popular Internet applications and have become a major source of Internet traffic, so it is extremely important that these systems be scalable.
Scalable, efficient range queries for grid information services
275 Citations2003Artur Andrzejak, Zhichen Xu
This work proposes a CAN-based extension of a DHT-functionality for distributed storing of pairs which complements current solutions such as MDS-2 by adding self-organization, fault-tolerance and an ability to efficiently handle dynamic attributes, such as server processing capacity.
A Metadata Catalog Service for Data Intensive Applications
227 Citations2003Gurmeet Singh, S. Bharathi +6 more
The design of a Metadata Catalog Service (MCS) is presented that provides a mechanism for storing and accessing descriptive metadata and allows users to query for data items based on desired attributes and a scalability study of the service is presented.
Lecture notes in computer scienceThree Implementations of SquishQL, a Simple RDF Query Language
178 Citations2002Libby Miller, Andy Seaborne +1 more
A conceptual model for querying RDF data that refines ideas first presented in at the W3C workshop on Query Languages and the design of one possible syntax, derived from [7], that is suitable for application programmers are described.
The chatty web
177 Citations2003Karl Aberer, Philippe Cudré-Mauroux +1 more
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semi-automatic manner without relying on pre-existing, global semantic models and develops a formal framework that takes into account both syntactic and semantic criteria.
Remindin'
171 Citations2004Christoph Tempich, Steffen Staab +1 more
This work defines a method for query routing, REMINDIN', that lets peers observe which queries are successfully answered by other peers, and memorizes this observation, and subsequently uses this information in order to select peers to forward requests to.
Flexible information discovery in decentralized distributed systems
165 Citations2004Cristina Schmidt, Manish Parashar
A P2P information discovery system that supports flexible queries using partial keywords and wildcards, and range queries that guarantees that all existing data elements that match a query are found with bounded costs in terms of number of messages and number of peers involved.
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
104 Citations2005Min Cai, Ann Chervenak +1 more
A Peer-to-Peer Replica Location Service with properties of self-organization, fault-tolerance and improved scalability, and a predecessor replication scheme is introduced that reduces query hotspots of popular mappings by distributing queries among nodes.
Index structures and algorithms for querying distributed RDF repositories
99 Citations2004Heiner Stuckenschmidt, Richard Vdovjak +2 more
This paper presents an architecture for querying distributed RDF repositories by extending the existing Sesame system, and proposes an index structure as well as algorithms for query processing and optimization in such a distributed context.
Lecture notes in computer sciencePublish/Subscribe for RDF-based P2P Networks
72 Citations2004Paul‐Alexandru Chirita, Stratos Idreos +2 more
This paper presents the first implementation of a P2P publish/subscribe system supporting metadata and a query language based on RDF, and defines formally the basic concepts of the system and presents detailed protocols for its operation.
Grid-based metadata services
63 Citations2004Ewa Deelman, Gurmeet Singh +7 more
IEEE Internet ComputingWeb services notifications
60 Citations2004Steve Vinoski
As Web services have matured, they've also acquired the need for asynchronous push capabilities, and the details required by the service for sending a reply are implicit in the RPC network connection.
A publish and subscribe architecture for distributed metadata management
29 Citations2003Markus Keidl, Alexander Kreutz +2 more
The architecture of MDV ("Meta-Data Verwalter"), a distributed meta-data management system, is presented, which has a three-tier architecture and supports caching and replication in the middle tier so that queries can be evaluated locally.
Lecture notes in computer sciencePePeR: A Distributed Range Addressing Space for Peer-to-Peer Systems
19 Citations2004Antonios Daskos, Shahram Ghandeharizadeh +1 more
This paper describes a Peer-to-Peer Range (PePeR) addressing space to process the “select” relational algebra operator and presents performance numbers from PePeR and compares it with a distributed hash table (DHT).
ScholarlyCommons (University of Pennsylvania)Piazza: Data Management Infrastructure for Semantic Web Applications
15 Citations2003Halevy, Alon Y, Ives, Zachary G +2 more
The Chatty Web: Emergent Semantics Through Gossiping
7 Citations2002Aberer, Karl, Cudré-Mauroux, Philippe +1 more
SWAP - A Semantics-Based Peer-to-Peer System Demonstration
1 Citations2003Marc Ehrig, Peter Haase +2 more
The SWAP-environment is presented which enables the exchange of knowledge on the basis of a peer-to-peer system and is focusing on technical aspects.