Bibster – A Semantics-Based Bibliographic Peer-to-Peer System
Lecture notes in computer sciencePublished 1 January 2004
Peter Haase, Jeen Broekstra, Marc Ehrig, Maarten Menken, Peter Mika, Mariusz Olko
Citations130
SJR quartileQ2
SJR score0.35
SNIP0.55
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.
TL;DR
The design and implementation of Bibster, a Peer-to-Peer system for exchanging bibliographic data among researchers, is described, which is a fully implemented open source solution built on top of the JXTA platform.
Abstract
This paper describes the design and implementation of Bibster, a Peer-to-Peer system for exchanging bibliographic data among researchers. Bibster exploits ontologies in data storage, query formulation, query routing and answer presentation: When bibliographic entries are made available for use in Bibster, they are structured and classified according to two different ontologies. This ontological structure is then exploited to help users formulate their queries. Subsequently, the ontologies are used to improve query routing across the Peer-to-Peer network. Finally, the ontologies are used to post-process the returned answers in order to do duplicate detection. The paper describes each of these ontology-based aspects of Bibster. Bibster is a fully implemented open source solution built on top of the JXTA platform.
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.
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.
IEEE Transactions on Systems Man and CyberneticsDevelopment and application of a metric on semantic nets
1,810 Citations1989Roy Rada, Hafedh Mili +2 more
Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts.
Lecture notes in computer scienceSesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
1,333 Citations2002Jeen Broekstra, Arjohn Kampman +1 more
This work presents an overview of Sesame, an architecture for efficient storage and expressive querying of large quantities of metadata in RDF and RDF Schema, and its implementation and the first experiences with this implementation.
IEEE Transactions on Knowledge and Data EngineeringAn approach for measuring semantic similarity between words using multiple information sources
1,087 Citations2003Yuhua Li, Zuhair Bandar +1 more
This paper explores the determination of semantic similarity by a number of information sources, which consist of structural semantic information from a lexical taxonomy and information content from a corpus.
Lecture notes in computer scienceMeasuring Similarity between Ontologies
781 Citations2002Alexander Maedche, Steffen Staab
A set of ontology similarity measures and a multiple-phase empirical evaluation are presented for measuring the similarity between ontologies for the task of detecting and retrieving relevant ontologies.
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.
ACM SIGMOD RecordP-Grid
353 Citations2003Karl Aberer, Philippe Cudré-Mauroux +5 more
Self-organizing Structured P2P systems are described, which have generated substantial interest because of emergent globalscale phenomena and the most prominent class of approaches are distributed hash tables (DHT) and Chord.
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.
ACM SIGMOD RecordThe Piazza peer data management project
209 Citations2003Igor Tatarinov, Zachary G. Ives +8 more
A brief overview of the Piazza project is provided including work on developing mapping languages and query reformulation algorithms, assisting the users in defining mappings, indexing, and enforcing access control over shared data.
ACM SIGCOMM Computer Communication ReviewpSearch
180 Citations2003Chunqiang Tang, Zhichen Xu +1 more
An efficient peer-to-peer information retrieval system, pSearch; that supports state-of-the-art content- and semantic-based full-text searches, avoiding the scalability problem of existing systems that employ centralized indexing, or index/query flooding.
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.
The MIT Press eBooksSesame: An Architecture for Storing and Querying RDF Data and Schema Information
136 Citations2003Jeen Broekstra, Arjohn Kampman +1 more
Sesame is an extensible architecture implementing a query engine for RQL, the most powerful RDF/RDF Schema query language to date.
Lecture notes in computer sciencePeer Selection in Peer-to-Peer Networks with Semantic Topologies
113 Citations2004Peter Haase, Ronald Siebes +1 more
This work proposes a model in which peers advertise their expertise in the Peer-to-Peer network, based on the semantic similarity between the subject of a query and the expertise of other peers, so that a peer can select appropriate peers to forward queries to, instead of broadcasting the query or sending it to a random set of peers.
Comparing ontologies - similarity measures and a comparison study
71 Citations2001Alexander Maedche, Steffen Staab
A methodology for measuring the extents to which two ontologies overlap and fit with each other at various semiotic levels is proposed and intersubject agreement about domain ontologies is determined.
Data Archiving and Networked Services (DANS)A Metadata Model for Semantics-Based Peer-to-Peer Systems
68 Citations2003Marc Ehrig, Ch. Tempich +6 more
A data model for encoding semantic information that combines features of ontology with a flexible description and rating model that allows us to handle heterogeneous and even contradictory views on the domain of interest is proposed.
SeRQL: An RDF Query and Transformation Language
44 Citations2004Arjohn Kampman
This paper introduces a set of general requirements for an RDF query language, compiled from discussions between RDF implementors, experience and user feedback, and concludes that SeRQL can be considered a real second generation RDF querying and transformation language.
OAI-P2P: a peer-to-peer network for open archives
40 Citations2003Benjamin Ahlborn, Wolfgang Nejdl +1 more
This work proposes that data providers form a peer-to-peer network which supports distributed search over all connected metadata repositories, which would allow OAI repositories to provide distributed search capabilities and effortless integration of new archives within a peer topeer network with little additional implementation effort.