scholarly journals Ανακάλυψη και ολοκλήρωση δεδομένων στο σημασιολογικό ιστό

2008 ◽  
Author(s):  
Δημήτριος Σκούτας

The Web constitutes a universal repository providing a huge amount of information in a variety of topics and formats. At the same time, the number of users has increased significantly, their participation has become more active, and their needs are more complex. Thus, new trends arise, emphasizing on the need for integration and collaboration. To address these new challenges, a lot of research efforts have been devoted to the transition to the Semantic Web, which will enhance the current Web with formal and explicit metadata, promising to facilitate interoperability and to increase the automation in searching, managing, and sharing information. In this direction, this thesis studies the problem of searching for relevant services and data on the Semantic Web, as well as integrating information from heterogeneous sources to meet specific needs and requirements. First, we study the problem of Web service discovery. We propose a similarity measure for comparing service descriptions, using the semantic information conveyed by the ontologies used to annotate these descriptions. We also develop techniques, drawing from concepts related to skyline queries, for ranking available services under diverse user preferences and multiple matching criteria. Then, we study the search of services and data in distributed environments, considering peer-to-peer networks where the available resources are semantically annotated. We propose an approach for efficient and progressive search of services in a structured peer-to-peer overlay network, and a method to facilitate the sharing of structured data in an ontology-enhanced peer data management system. Finally, we propose techniques to facilitate the conceptual design of Extract-Transform-Load processes, which are critical processes for reconciling information from several heterogeneous sources. These techniques also rely on the use of ontologies to identify correspondences, conflicts, and transformations between the source and target specifications.

2006 ◽  
Vol 25 ◽  
pp. 269-314 ◽  
Author(s):  
P. Adjiman ◽  
P. Chatalic ◽  
F. Goasdoue ◽  
M. C. Rousset ◽  
L. Simon

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers.


2008 ◽  
Author(s):  
Satish Narayana Srirama ◽  
Matthias Jarke ◽  
Hongyan Zhu ◽  
Wolfgang Prinz

2013 ◽  
Vol 6 (1) ◽  
pp. 64-75 ◽  
Author(s):  
Qiang He ◽  
Jun Yan ◽  
Yun Yang ◽  
Ryszard Kowalczyk ◽  
Hai Jin

2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU

Sign in / Sign up

Export Citation Format

Share Document