In this paper we present the current achievement of our research activity in the WISDOM project, whose aim is the definition of intelligent techniques enabling e®ective and e±cient information search in a distributed and decentralized PDMS scenario. We focus on the query routing problem and we define a new routing mechanism, which we call routing by mapping, in which the query is sent to the peers whose subnetworks best approximate the concepts required. In order to select the best subnetworks, the peer receiving the query exploits information about the semantic approximation of the query concepts, when moving towards each neighbour. This information is computed starting from the semantic mappings established with the peer's neighbours and it is maintained into specifically devised data structures called Semantic Routing Indices (SRIs), whose update we propose specific algorithms and protocols for. The effectiveness of the achieved results has been experimentally proved through a series of exploratory tests.
Using Semantic Mappings for Query Routing in a PDMS Environment / Mandreoli, F.; Martoglia, R.; Penzo, Wilma; Tiberio, P.; Sassatelli, S.. - STAMPA. - (2006), pp. 56-63. (Intervento presentato al convegno Quattordicesimo Convegno Nazionale su Sistemi Evoluti per Basi di Dati (SEBD 2006) tenutosi a Portonovo (AN) nel June, 2006).
Using Semantic Mappings for Query Routing in a PDMS Environment
PENZO, WILMA;
2006
Abstract
In this paper we present the current achievement of our research activity in the WISDOM project, whose aim is the definition of intelligent techniques enabling e®ective and e±cient information search in a distributed and decentralized PDMS scenario. We focus on the query routing problem and we define a new routing mechanism, which we call routing by mapping, in which the query is sent to the peers whose subnetworks best approximate the concepts required. In order to select the best subnetworks, the peer receiving the query exploits information about the semantic approximation of the query concepts, when moving towards each neighbour. This information is computed starting from the semantic mappings established with the peer's neighbours and it is maintained into specifically devised data structures called Semantic Routing Indices (SRIs), whose update we propose specific algorithms and protocols for. The effectiveness of the achieved results has been experimentally proved through a series of exploratory tests.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
