Please use this identifier to cite or link to this item:
|Title:||Dynamic clustering-based query answering in peer-to-peer systems|
|Citation:||Qian, W.,Zhou, S.,Ren, Y.,Zhou, A.,Ooi, B.C.,Tan, K.-L. (2003). Dynamic clustering-based query answering in peer-to-peer systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2762 : 306-313. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we propose a new query answering model for P2P applications, which is termed as clustering-based query answering (CBQA). CBQA will retrieve the data objects that are in the same cluster of the query from the global dataset distributed over peers of a P2P system. We first present a framework that support clustering based query answering. Then we give three concrete algorithms for different clustering criteria, namely k-nearest-neighbor, distance-based, and density-based clustering, along with detailed analyses. Finally, implementation issues, especially dynamic neighbors selection to enable the scalability are addressed. Theoretical analysis shows that our method can guarantee to find desirable objects in the interested cluster with modest overhead. © Springer-Verlag Berlin Heidelberg 2003.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.