Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks
Gespeichert in:
| Titel: | Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks |
|---|---|
| Autoren: | Ioannis Chrysakis, Dimitris Plexousakis |
| Weitere Verfasser: | The Pennsylvania State University CiteSeerX Archives |
| Quelle: | http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf. |
| Publikationsjahr: | 2006 |
| Bestand: | CiteSeerX |
| Schlagwörter: | top-k queries, query processing, query routing, p2p networks, schema-based p2p systems} Technical areas, peer-to-peer systems, databases, semantic web |
| Beschreibung: | Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of peer-to-peer (p2p) systems called schema-based. In such systems each peer is a database management system in itself, exposing its own schema. In such a setting, a main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this report, we adopt a super-peer-based architecture and suggest a query routing mechanism, upon which we propose a query processing technique for top-k queries. Top-k queries in the context of p2p systems give the opportunity to filter the results and to eliminate network traffic by choosing the k highest ranked results. We introduce HT-p2p and HT-p2p+, two extended versions of the Hybrid Threshold Algorithm adapted to our p2p scenario. For the evaluation of these algorithms we implemented a prototype system upon the JXTA platform. Extensive experiments with different data sets and parameters have shown promising results about the performance of the query processing strategy. ± Acknowledgement: Special thanks to Evi Dagalaki for her contribution to the evaluation process. 1 |
| Publikationsart: | text |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199 |
| Verfügbarkeit: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199 http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Dokumentencode: | edsbas.34F2EBB1 |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of peer-to-peer (p2p) systems called schema-based. In such systems each peer is a database management system in itself, exposing its own schema. In such a setting, a main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this report, we adopt a super-peer-based architecture and suggest a query routing mechanism, upon which we propose a query processing technique for top-k queries. Top-k queries in the context of p2p systems give the opportunity to filter the results and to eliminate network traffic by choosing the k highest ranked results. We introduce HT-p2p and HT-p2p+, two extended versions of the Hybrid Threshold Algorithm adapted to our p2p scenario. For the evaluation of these algorithms we implemented a prototype system upon the JXTA platform. Extensive experiments with different data sets and parameters have shown promising results about the performance of the query processing strategy. ± Acknowledgement: Special thanks to Evi Dagalaki for her contribution to the evaluation process. 1 |
|---|