dc.contributor.author |
Kantere, V |
en |
dc.contributor.author |
Tsoumakos, D |
en |
dc.contributor.author |
Sellis, T |
en |
dc.contributor.author |
Roussopoulos, N |
en |
dc.date.accessioned |
2014-03-01T01:30:50Z |
|
dc.date.available |
2014-03-01T01:30:50Z |
|
dc.date.issued |
2009 |
en |
dc.identifier.issn |
0306-4379 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/19639 |
|
dc.subject |
Peer-to-Peer databases |
en |
dc.subject |
Query reformulation in P2P databases |
en |
dc.subject |
Semantics in P2P query answering |
en |
dc.subject |
Structured data in unstructured P2P overlays |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.other |
Information theory |
en |
dc.subject.other |
Ketones |
en |
dc.subject.other |
Automated approaches |
en |
dc.subject.other |
Challenging problems |
en |
dc.subject.other |
Dynamic clustering |
en |
dc.subject.other |
Human interactions |
en |
dc.subject.other |
Mediated schemata |
en |
dc.subject.other |
Number of nodes |
en |
dc.subject.other |
P2P databases |
en |
dc.subject.other |
P2p networks |
en |
dc.subject.other |
Peer-to-Peer databases |
en |
dc.subject.other |
Propagation paths |
en |
dc.subject.other |
Query reformulation in P2P databases |
en |
dc.subject.other |
Rewritten queries |
en |
dc.subject.other |
Schemas |
en |
dc.subject.other |
Standard practices |
en |
dc.subject.other |
Structured data in unstructured P2P overlays |
en |
dc.subject.other |
Structured datums |
en |
dc.subject.other |
Unstructured P2P |
en |
dc.subject.other |
Database systems |
en |
dc.title |
GrouPeer: Dynamic clustering of P2P databases |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1016/j.is.2008.04.002 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1016/j.is.2008.04.002 |
en |
heal.language |
English |
en |
heal.publicationDate |
2009 |
en |
heal.abstract |
Sharing structured data in a P2P network is a challenging problem, especially in the absence of a mediated schema. The standard practice of answering a consecutively rewritten query along the propagation path often results in significant loss of information. On the opposite, the use of mediated schemas requires human interaction and global agreement, both during creation and maintenance. In this paper we present GrouPeer, an adaptive, automated approach to both issues in the context of unstructured P2P database overlays. By allowing peers to individually choose which rewritten version of a query to answer and evaluate the received answers, information-rich sources left hidden otherwise are discovered. Gradually, the overlay is restructured as semantically similar peers are clustered together. Experimental results show that our technique produces very accurate answers and builds clusters that are very close to the optimal ones by contacting a very small number of nodes in the overlay. (c) 2008 Elsevier B.V. All rights reserved. |
en |
heal.publisher |
PERGAMON-ELSEVIER SCIENCE LTD |
en |
heal.journalName |
Information Systems |
en |
dc.identifier.doi |
10.1016/j.is.2008.04.002 |
en |
dc.identifier.isi |
ISI:000262892200004 |
en |
dc.identifier.volume |
34 |
en |
dc.identifier.issue |
1 |
en |
dc.identifier.spage |
62 |
en |
dc.identifier.epage |
86 |
en |