HEAL DSpace

Querying structured data in an unstructured P2P system

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Kantere, V en
dc.contributor.author Tsoumakos, D en
dc.contributor.author Roussopoulos, N en
dc.date.accessioned 2014-03-01T02:42:56Z
dc.date.available 2014-03-01T02:42:56Z
dc.date.issued 2004 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31144
dc.subject Peer-to-Peer en
dc.subject Query Reformulation en
dc.subject Structured Data en
dc.subject.other Peer-to-peer networks en
dc.subject.other Query reformulation en
dc.subject.other Query routing en
dc.subject.other Structured data en
dc.subject.other Algorithms en
dc.subject.other Bandwidth en
dc.subject.other Metadata en
dc.subject.other Optimization en
dc.subject.other Query languages en
dc.subject.other Topology en
dc.subject.other Computer networks en
dc.title Querying structured data in an unstructured P2P system en
heal.type conferenceItem en
heal.identifier.primary 10.1145/1031453.1031466 en
heal.identifier.secondary http://dx.doi.org/10.1145/1031453.1031466 en
heal.publicationDate 2004 en
heal.abstract Peer-to-Peer networking has become a major research topic over the last few years. Sharing of structured data in such decentralized environments is a challenging problem, especially in the absence of a global schema. The standard practice of answering a query that is consecutively rewritten along the propagation path often results in significant loss of information. In this paper, we present an adaptive and bandwidth-efficient solution to the problem in the context of an unstructured, purely decentralized system. Our method allows peers to individually choose which rewritten version of a query to answer and discover information-rich sources left hidden otherwise. Utilizing normal query traffic only, we describe how efficient query routing and clustering of peers can be used to produce high quality answers. Simulation results show that our technique is both effective and bandwidth-efficient in a variety of workloads and network sizes. Copyright 2004 ACM. en
heal.journalName Proceedings of the Interntational Workshop on Web Information and Data Management en
dc.identifier.doi 10.1145/1031453.1031466 en
dc.identifier.spage 64 en
dc.identifier.epage 71 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής