Abstract
Peer databases are individual, independently developed data- bases that contain local data, but are also linked to each other through acquaintances for the purpose of sharing data. Many researchers have tackled the problem of query processing in P2P networks. Only recently have researchers started to exploit the idea of community-based querying in peer database networks. P2P communities are formed using common claimed attributes. We develop a community-based search algorithm for peer databases. The algorithm combines an existing community formation and discovery algorithm with an existing query translation mechanism for peer databases. We have implemented the algorithm and report on preliminary experiments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hossain, M.D., Kiringa, I. (2007). Querying Communities of Interest in Peer Database Networks. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)