Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Background
Edutella Common Data and Query Exchange Model
Result Formats
Standard Result Set Syntax
Summary and Acknowledge-Ments
References
All Topics
Computer Science
Database Systems

EDUTELLA: A P2P networking infrastructure based on RDF

Profile image of Matthias PalmérMatthias Palmér

2002, Proceedings of the 11th International Conference on World Wide Web, WWW '02

Abstract

Metadata for the World Wide Web is important, but metadata for Peer-to-Peer (P2P) networks is absolutely crucial. In this paper we discuss the open source project Edutella which builds upon metadata standards defined for the WWW and aims to provide an RDFbased metadata infrastructure for P2P applications, building on the recently announced JXTA Framework. We describe the goals and main services this infrastructure will provide and the architecture to connect Edutella Peers based on exchange of RDF metadata. As the query service is one of the core services of Edutella, upon which other services are built, we specify in detail the Edutella Common Data Model (ECDM) as basis for the Edutella query exchange language (RDF-QEL-i) and format implementing distributed queries over the Edutella network. Finally, we shortly discuss registration and mediation services, and introduce the prototype and application scenario for our current Edutella aware peers.

Related papers

Toward widely deployable Semantic Web P2P: tools, definitions and the RDFGrowth algorithm
Mauro Mazzieri

ISWC'04 workshop on …, 2004

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. RDF-Growth 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.

View PDFchevron_right
Super-Peer-Based Routing Strategies for RDF-Based P2P Systems
Martin Wolpers

Proceedings of the 2nd …, 2004

View PDFchevron_right
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
Paolo Puliti

2004

We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers perform browsing and querying of semantic web statements on a local database without directly generating network traffic or remote 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 networks. A few assessments about the applicability of RDFGrowth to real semantic web applications are also given.

View PDFchevron_right
A Peer-to-Peer Information System for the Semantic Web
Sonia BERGAMASCHI

Data integration, in the context of the web, faces new problems, due in particular to the heterogeneity of sources, to the fragmentation of the information and to the absence of a unique way to structure and view information. In such areas, the traditional paradigms, on which database foundations are based (i.e. client server architecture, few sources containing large information), have to be overcome by new architectures. The peer-to-peer (P2P) architecture seems to be the best way to fulfill these new kinds of data sources, offering an alternative to traditional client/server architecture. In this paper we present the SEWASIE system that aims at providing access to heterogeneous web information sources. An enhancement of the system architecture in the direction of P2P architecture, where connections among SEWASIE peers rely on exchange of XML metadata, is described.

View PDFchevron_right
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
Martin Wolpers

Proceedings of the …, 2003

View PDFchevron_right
Design Issues and Challenges for RDF-and schema-based peer-to-peer systems
Wolf Siberski

ACM SIGMOD Record, 2003

Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer- to-peer (P2P) networks, similar approaches are just be- ginning to emerge. While quite a few database tech- niques can be re-used in this new context, a ...

View PDFchevron_right
A peer-to-peer architecture for distributed and reliable RDF storage
Antonio Servetti

2009

Knowledge management systems share information from multiple sources over the network and may have problems in maintaining the consistency due to node failures and data fragmentation in different locations. In this paper we present an architecture for a load balanced and reliable RDF storage system for semantic information distributed over a peer-to-peer network. Peers are self organized in a ring topology, based on a distributed hash table (DHT), where each node is assigned a segment of the key space that can dynamically change in order to maintain a uniform distribution of the data among the participating peers. Data redundancy is then used to replicate each RDF triple in multiple locations so that, in case of peer failures, neighbour nodes can act on their behalf and return consistent results. Additionally, each node provides an entry point able to resolve atomic, disjunctive and conjunctive SPARQL queries on the network semantic knowledge. The performance of this approach is evaluated by monitoring the effectiveness of the load balancing and redundancy algorithm and the overhead introduced on the network load in both a static (only join events) and dynamic scenario.

View PDFchevron_right
Super-peer-based routing strategies for RDF-based peer-to-peer networks
Martin Wolpers

Web Semantics: Science …, 2004

View PDFchevron_right

References (40)

  1. 1 Query Exchange Architecture Edutella peers are highly heterogeneous in terms of the func- tionality (i.e. services) they offer. A simple peer has RDF storage http://www.xyz.com/ai.html http://www.lit.edu/types#Book Artificial Intelligence dc:title rdf:type http://www.xyz.com/pl.html http://www.lit.edu/types#AI-Book rdf:type
  2. REFERENCES
  3. Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web. Morgan Kaufmann Publishers, 2000.
  4. Dan Brickley and R. V. Guha. W3C Resource Description Framework (RDF) Schema Specification. http://www.w3.org/TR/1998/WD-rdf-schema/, March 2000. W3C Candidate Recommendation.
  5. Jeen Broekstra. RQL Tutoria: Babysteps in Sesame RQL. Aidministrator Nederland, September 2001. Version 0.5.
  6. James Clark and Steve deRose. XML Path Language (XPath), version 1.0. Technical report, W3C, November 1999. W3C Recommendation.
  7. IEEE Learning Technology Standards Committee. IEEE LOM Working Draft 6.1. http://ltsc.ieee.org/wg12/index.html, April 2001.
  8. dbXML Group. dbxml native database. http://www.dbXML.org/.
  9. Hadhami Dhraief, Wolfgang Nejdl, Boris Wolf, and Martin Wolpers. Open learning repositories and metadata modeling. In International Semantic Web Working Symposium (SWWS), Stanford, CA, July 2001.
  10. Rael Dornfest and Dan Brickley. The power of metadata. http://www.openp2p.com/pub/a/p2p/2001/01/18/metadata.html, January 2001. excerpted from the book "Peer-to-Peer: Harnessing the Power of Disruptive Technologies.
  11. The Edutella Project. http://edutella.jxta.org/.
  12. Li Gong. Project JXTA: A technology overview. Technical report, SUN Microsystems, April 2001. http://www.jxta.org/project/www/docs/TechOverview.pdf.
  13. Siegfried Handschuh and Steffen Staab. Authoring and annotation of web pages in cream. In Proceedings of WWW-2002. ACM Press, 2002.
  14. Pat Hayes. Rdf model theory. Technical report, W3C Working Draft, September 2001.
  15. IMS Global Learning Consortium Inc. IMS Learning Resource Metadata Specification v1.2.1. http://www.imsproject.org/metadata/index.html.
  16. M. Jarke, R. Gallersdörfer, M. Jeusfeld, M. Staudt, and S. Eherer. ConceptBase -a deductive object base for meta data management. Journal on Intelligent Information Systems, 4(2):167 -192, 1995.
  17. V. Josifovski, T. Katchaounov, and T. Risch. Optimizing queries in distributed and composable mediators. In 4th Conference on Cooperative Information Systems, CoopIS'99, pages 435 -446, Edinburgh, Scotland, September 1999. http://www.dis.uu.se/ udbl/publ/coopis99.pdf.
  18. V. Josifovski and T. Risch. Functional query optimization over object-oriented views for data integration. Journal of Intelligent Information Systems (JIIS), 12(2-3):165 -190, 1999.
  19. V. Josifovski and T. Risch. Integrating heterogeneous overlapping databases through object-oriented transformations. In 25th Conf. on Very Large Databases (VLDB'99), pages 435 -446, Edinburgh, Scotland, September 1999. http://www.dis.uu.se/ udbl/publ/vldb99.pdf.
  20. Project JXTA Homepage. http://www.jxta.org/.
  21. G. Karvounarakis, V. Christophides, D. Plexousakis, and S. Alexaki. Querying community web portals, 2001. Available at http://www.ics.forth.gr/proj/isst/RDF/RQL/, 2001. Submitted for publication.
  22. Michael Kifer, Georg Lausen, and James Wu. Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741-843, 1995.
  23. Stefan Kokkelink and Roland Schwänzl. Expressing Qualified Dublin Core in RDF/XML. DCMI, August 2001. http://dublincore.org/documents/2001/08/29/dcq-rdf-xml/.
  24. Ora Lassila and Ralph R. Swick. W3C Resource Description framework (RDF) Model and Syntax Specification. http://www.w3.org/TR/REC-rdf-syntax/, February 1999. W3C Recommendation.
  25. W. Litwin and T. Risch. Main memory oriented optimization of oo queries using typed datalog with foreign predicates. IEEE Transactions on Knowledge and Data Engineering, 4(6):517 -528, 1992.
  26. J. W. Lloyd and R. W. Topor. Making prolog more expressive. Journal of Logic Programming, 3:225-240, 1984.
  27. A. Mädche, S. Staab, R. Studer, Y. Sure, and R. Volz. Seal - tying up information integration and web site management by ontologies. IEEE Data Engineering Bulletin, March 2002. http://www.aifb.uni- karlsruhe.de/ sst/Research/Publications/data-engineering- bulletin2002.pdf.
  28. D. Maier. A logic for objects. In Workshop on Foundations of Deductive Databases and Logic Programming, pages 6-26, 1986.
  29. Brian McBride. Jena: Implementing the rdf model and syntax specification. Technical report, Hewlett Packard Laboratories, Bristol, UK, 2000. http://www.hpl.hp.com/semweb/index.html.
  30. Sergey Melnik. RDF API Draft, January 2001. http://www-db.stanford.edu/ melnik/rdf/api.html.
  31. Wolfgang Nejdl, Hadhami Dhraief, and Martin Wolpers. O-telos-rdf: A resource description format with enhanced meta-modeling functionalities based on o-telos. In Workshop on Knowledge Markup and Semantic Annotation at the First International Conference on Knowledge Capture (K-CAP'2001), Victoria, BC, Canada, October 2001.
  32. Mikael Nilsson and Matthias Palmér. Conzilla -towards a concept browser. Technical Report CID-53, TRITA-NA-D9911, Department of Numeri- cal Analysis and Computing Science, KTH, Stockholm, 1999. http://kmr.nada.kth.se/papers/ConceptualBrowsing/cid 53.pdf.
  33. T.C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the ACM Symposium on Principle of Database Systems (PODS), pages 11-21, 1989.
  34. Changtao Qu and Wolfgang Nejdl. Towards interoperability and reusability of learning resources: A SCORM-conformant courseware for computer science education. Technical report, Learning Lab Lower Saxony, University of Hannover, October 2001.
  35. T. Risch and V. Josifovski. Distributed data integration by object-oriented mediator servers. Concurrency and Computation: Practice and Experience, 13(11):933 -953, 2001.
  36. Abraham Silberschatz, Henry F. Korth, and S. Sudarshan. Database Systems Concepts. McGraw-Hill Higher Education, 4 edition, 2001.
  37. Michael Sintek and Stefan Decker. TRIPLE-An RDF query, inference, and transformation language. In Deductive Databases and Knowledge Management (DDLP'2001), October 2001. http://www.dfki.uni-kl.de/frodo/triple/TripleReport.pdf.
  38. SUN Microsystems. JXTA v1.0 Protocols Specification, 2001. http://spec.jxta.org/v1.0/docbook/JXTAProtocols.html.
  39. ADL Technical Team. SCORM Specification v1.2. http://www.adlnet.org/Scorm/scorm.cfm, October 2001.
  40. G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38 -49, 1992.

Related papers

EDUTELLA: P2P Networking for the Semantic Web
Ambjorn Naeve

2003

this paper we discuss the open source project Edutella which builds upon metadata standards definedfor the WWW and aims to provide an RDF-based metadata infrastructure for P2P applications. Edutella is thefirst system which brings together RDF and P2P concepts and exploits their strengths in a common framework,suitable for building general schema-based P2P networks for distributed and dynamic information providers. Wedescribe

View PDFchevron_right
EDUTELLA: Searching and Annotating Resources within an RDF-based P2P Network
Wolfgang Nejdl

2002

P2P applications for searching and exchanging information over the Web have become increasingly popular. This has lead to a number of (usually thematically) focused communities, which allow efficient searching within such communities, and which use specific metadata sets to specify the resources stored within the P2P network. By concentrating on domain and application specific formats for metadata and query languages, however, current P2P networks appear to be fragmenting into non-interoperable niche markets. This contribution describes the open source project Edutella 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. We describe one basic service (query) and an Edutella application (annotation) within this network, both being built on a common query language exchange format, and specify the main architecture and APIs of the Edutella P2P network.

View PDFchevron_right
An O-telos provider peer for the rdf-based edutella p2p-network
Martin Wolpers

… (SAAKM 2002) at 15th European Conf …, 2002

View PDFchevron_right
Query processing in RDF/S-based P2P database systems
Vassilis Christophides

2006

Summary. In Peer-to-peer (P2P) systems a very large number of autonomous computing nodes (the peers) pool together their resources and rely on each other for data and services. More and more P2P data management systems rely nowadays on intensional (ie, schema) information for integrating and querying peer bases. Such information can be easily captured by emerging Semantic Web languages such as RDF/S.

View PDFchevron_right
Rdf-based peer-to-peer-networks for distributed (learning) repositories
Martin Wolpers

VLDB journal www. kbs …, 2002

View PDFchevron_right

Related topics

  • Computer Science
  • Query Languages
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved