Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' contents and relationships. In a PDMS scenario a key challenge is query routing, i.e. the capability of selecting small subsets of semantically relevant peers to forward a query to. In this paper we demonstrate SUNRISE (System for Unified Network Routing, Indexing and Semantic Exploration), a complete infrastructure which supports an effective and efficient exploration of a PDMS network for query answering purposes. SUNRISE offers several routing policies designed around different performance priorities in order to minimize the information spanning over the network.
Mandreoli, F., Martoglia, R., Penzo, W., Sassatelli, S., Villani, G. (2008). Efficient and Effective Query Answering in a PDMS with SUNRISE. PALERMO : s.n.
Efficient and Effective Query Answering in a PDMS with SUNRISE
PENZO, WILMA;
2008
Abstract
Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' contents and relationships. In a PDMS scenario a key challenge is query routing, i.e. the capability of selecting small subsets of semantically relevant peers to forward a query to. In this paper we demonstrate SUNRISE (System for Unified Network Routing, Indexing and Semantic Exploration), a complete infrastructure which supports an effective and efficient exploration of a PDMS network for query answering purposes. SUNRISE offers several routing policies designed around different performance priorities in order to minimize the information spanning over the network.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.