Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks
Uloženo v:
| Název: | Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks |
|---|---|
| Autoři: | Ioannis Chrysakis, Dimitris Plexousakis |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf. |
| Rok vydání: | 2006 |
| Sbírka: | CiteSeerX |
| Témata: | top-k queries, query processing, query routing, p2p networks, schema-based p2p systems} Technical areas, peer-to-peer systems, databases, semantic web |
| Popis: | 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 |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199 |
| Dostupnost: | 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. |
| Přístupové číslo: | edsbas.34F2EBB1 |
| Databáze: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199# Name: EDS - BASE (s4221598) Category: fullText Text: View record from BASE – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Chrysakis%20I Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.34F2EBB1 RelevancyScore: 836 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 836.004333496094 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ioannis+Chrysakis%22">Ioannis Chrysakis</searchLink><br /><searchLink fieldCode="AR" term="%22Dimitris+Plexousakis%22">Dimitris Plexousakis</searchLink> – Name: Author Label: Contributors Group: Au Data: The Pennsylvania State University CiteSeerX Archives – Name: TitleSource Label: Source Group: Src Data: <i>http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf</i>. – Name: DatePubCY Label: Publication Year Group: Date Data: 2006 – Name: Subset Label: Collection Group: HoldingsInfo Data: CiteSeerX – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22top-k+queries%22">top-k queries</searchLink><br /><searchLink fieldCode="DE" term="%22query+processing%22">query processing</searchLink><br /><searchLink fieldCode="DE" term="%22query+routing%22">query routing</searchLink><br /><searchLink fieldCode="DE" term="%22p2p+networks%22">p2p networks</searchLink><br /><searchLink fieldCode="DE" term="%22schema-based+p2p+systems}+Technical+areas%22">schema-based p2p systems} Technical areas</searchLink><br /><searchLink fieldCode="DE" term="%22peer-to-peer+systems%22">peer-to-peer systems</searchLink><br /><searchLink fieldCode="DE" term="%22databases%22">databases</searchLink><br /><searchLink fieldCode="DE" term="%22semantic+web%22">semantic web</searchLink> – Name: Abstract Label: Description Group: Ab Data: 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 – Name: TypeDocument Label: Document Type Group: TypDoc Data: text – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199 – Name: URL Label: Availability Group: URL Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.199<br />http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf – Name: Copyright Label: Rights Group: Cpyrght Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it. – Name: AN Label: Accession Number Group: ID Data: edsbas.34F2EBB1 |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.34F2EBB1 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: top-k queries Type: general – SubjectFull: query processing Type: general – SubjectFull: query routing Type: general – SubjectFull: p2p networks Type: general – SubjectFull: schema-based p2p systems} Technical areas Type: general – SubjectFull: peer-to-peer systems Type: general – SubjectFull: databases Type: general – SubjectFull: semantic web Type: general Titles: – TitleFull: Semantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ioannis Chrysakis – PersonEntity: Name: NameFull: Dimitris Plexousakis – PersonEntity: Name: NameFull: The Pennsylvania State University CiteSeerX Archives IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2006 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa Titles: – TitleFull: http://www.ics.forth.gr/ftp/tech-reports/2006/2006.TR387_Distributed_Top-K_Query_Processing_P2P_Networks.pdf Type: main |
| ResultId | 1 |
Nájsť tento článok vo Web of Science