Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.

Ontology Matching

Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content.In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. Our approach focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in---and affected by---the architectural design decisions adopted by current peer-to-peer systems.We study current peer-to-peer systems and infrastructure technologies in terms of their distributed object location and routing mechanisms, their approach to content replication, caching and migration, their support for encryption, access control, authentication and identity, anonymity, deniability, accountability and reputation, and their use of resource trading and management schemes.

/pdf/a-survey-of-peer-to-peer-content-distribution-technologies-j5f2edwj5n.pdf

A survey of peer-to-peer content distribution technologies

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

/pdf/edutella-a-p2p-networking-infrastructure-based-on-rdf-n5rblvwxcx.pdf

EDUTELLA: a P2P networking infrastructure based on RDF

Microsoft has promoted ASP.NET’s new web services more than almost any other part of the.NET Framework. But despite their efforts, confusion is still widespread about what a web service is and, more importantly, what it’s meant to accomplish. This chapter introduces web services and explains their role in Microsoft’s vision of the programmable web. Along the way, you’ll learn about the open standards plumbing that allows web services to work and removes some of the confusion surrounding technical terms like WSDL (Web Service Description Language), SOAP, and UDDI (universal description, discovery, and integration).

Web Services Architecture

https://www.cs.umd.edu/projects/p2prg/p2p-overview.pdf

Survey of research towards robust peer-to-peer networks: search methods

Query language for semantic web: EDUTELLA: a P2P networking infrastructure based on RDF

Edutella/JXTA is a P2P (peer-to-peer) semantic Web application, which is aimed to accommodate heterogeneous resource metadata repositories in a P2P manner and further facilitate the exchange of the resource metadata based on RDF. Whereas the initial use cases of Edutella/JXTA are defined and implemented in the context of a pure P2P setting, where all Edutella participants are JXTA peers interacting with each other via various P2P services, in this paper we investigate the interaction between Edutella/JXTA and Web services with the purpose of exchanging distributed functionalities between the two platforms. In terms of two typical interaction scenarios: (1) exposing existing Edutella/JXTA P2P services as Web services; and (2) integrating Web services enabled content providers into Edutella/JXTA, we propose an approach for achieving the service layer interaction between Edutella/JXTA and Web services through so-called Web services/Edutella proxies.

Interacting the Edutella/JXTA peer-to-peer network with Web services

In this paper we present our design and implementation of a SCORM (Sharable Content Object Reference Model)conformant CS courseware based on the latest SCORM specification 1.2, released by ADL (Advanced Distributed Learning) on Oct. 1, 2001. All learning resources contained in an existing Java course are re-designed according to the SCORM Content Model and further described with corresponding Assets-, SCO-, and Content Aggregation metadata. Also the course structure is reconstructed based on the SCORM Content Packaging specification, which provides a standardized way to represent the aggregation of learning resources and further exchange them between different learning management systems. Moreover, a Web-based SCORM Run-Time Environment is implemented utilizing Java Server Pages, Java Servlet, and JavaScript, which is able to dynamically render the course structure into its Web presentation on the basis of pre-defined SCORM Content Packaging Application Profile. Our SCORM-conformant development actually constitutes an early exploration to the great potential of the SCORM specification.

Towards Interoperability and Reusability of Learning Resources: a SCORM- conformant Courseware for Computer Science Education

Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. While obviously dynamic DHT algorithms which have to approximate these topologies for dynamically changing sets of peers play a very important role for DHT networks, important insights can be gained by clearly focussing on the static DHT topology as well. In this paper we analyze and classify current DHTs in terms of their static topologies based on the Cayley graph group-theoretic model and show that most DHT proposals use Cayley graphs as static DHT topologies, thus taking advantage of several important Cayley graph properties such as vertex/edge symmetry, decomposability and optimal fault tolerance. Using these insights, Cayley DHT design can directly leverage algebraic design methods to generate high-performance DHTs adopting Cayley graph based static DHT topologies, extended with suitable dynamic DHT algorithms.

https://link.springer.com/content/pdf/10.1007%2F978-3-540-30566-8_105.pdf

Changtao Qu

Papers

EDUTELLA: a P2P networking infrastructure based on RDF

Query language for semantic web: EDUTELLA: a P2P networking infrastructure based on RDF

Interacting the Edutella/JXTA peer-to-peer network with Web services

Towards Interoperability and Reusability of Learning Resources: a SCORM- conformant Courseware for Computer Science Education

Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs