Abstract
cSON (community Semantic Overlay Network) is a semantic overlay network organized around communities where each community is supposed, in this work, contains one super-peer and a set of peers: a super-peer describes the domain (e.g. ontology) supported by its community and a peer joins a community with its own data schema. We model cSON as a weighted connected graph G where vertices are communities and edges between two vertices represent semantic links between them. One challenge in cSON is how to efficiently extend the scope of the research to all communities. In this paper, we propose a distributed algorithm that builds, based on G, a maximal-affinity covering tree which is borrowed later by all queries. We give a performance evaluation concerning the creation of this tree and we compare then our routing algorithm with the one (called baseline) which consists to send queries to only neighboring communities which are able to treat them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bloom, B.: Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: IEEE Int. Conf. on Distributed Computing Systems, pp. 23–33 (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 561–579. MIT Press and McGraw-Hill (2001)
Faye, D.C., Nachouki, G., Valduriez, P.: un systéme pair-à -pair de médiation de données. Journal ARIMA, 24–48 (2006)
Faye, D., Nachouki, G., Valduriez, P.: Semantic Query Routing in SenPeer, a P2P Data Management System. In: Enokido, T., Barolli, L., Takizawa, M. (eds.) NBiS 2007. LNCS, vol. 4658, pp. 365–374. Springer, Heidelberg (2007)
Eppstein, D.: Spanning Trees and Spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461 (2000)
Huang, F., Gao, P., Wang, Y.: Comparison of Prim and Kruskal on Shanghai and Shenzhen 300 Index Hierarchical Structure Tree. In: Web Information Systems and Mining, pp. 237–241 (2009)
Ismaïl A.: communities in Semantic P2P Networks (in French), PHD Thesis, Marseille, France (2010)
Kalogeraki, V., Gunopoulos, D., Zeinalipour-Yazti, D: A local search mechanism for peer-to-peer networks. In: ACM Int. Conf. on Information and Knowledge Management (CIKM), pp. 300–307 (2002)
Kang, C.: Survey of search and optimization of P2P networks. In: Peer-to-Peer Net. Appl. (2010)
Löser, A., Tempich, C.: On Ranking Peers in Semantic Overlay Networks. In: 3rd Conference on Professional Knowledge Management (2005)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ACM Int. Conf. on Supercomputing, pp. 84–95 (2002)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8) (1966)
Menascé, D., Kanchanapalli, L.: Probabilistic scalable P2P resource location services. SIGMETRICS Performance Evaluation Review 30(2), 48–58 (2002)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. Carnegie Mellon University, Pittsburgh (2002)
Tversky, A.: Features of Similarity. Psychological Review 84(2) (1977)
Tsoumakos, D., Roussopoulos, N.: A Comparison of Peer-to-Peer Search Methods. In: International Workshop on the Web and Databases, pp. 61–66 (2003)
Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search (APS) for peer-to-peer networks. Technical Report, University of Maryland (2003)
Tempich, C.: REMINIDIN’: Semantic Query Routing in P2P Networks based on Social Metaphors. In: World Wide Web Conference (2004)
Taylor, I.: Extract of Peer-To-Peer: Harnessing the Power of Disruptive Technologies. In: Oram, A. (ed.). O’Reilly (2001)
Yang, B., Garcia-Molina, H: Improving search in peer-to-peer networks. In: Proc. of the IEEE Int. Conf. on Distributed Computing Systems, pp. 5–14 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nachouki, G., Quafafou, M. (2012). Efficient Research in Community Semantic Overlay Networks. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30567-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-30567-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30566-5
Online ISBN: 978-3-642-30567-2
eBook Packages: Computer ScienceComputer Science (R0)