{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:15Z","timestamp":1754157915948,"version":"3.41.2"},"reference-count":28,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2008,11,21]],"date-time":"2008-11-21T00:00:00Z","timestamp":1227225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,11,21]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The goal of this paper is to contribute to the development of both data localization and description techniques in P2P systems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The approach consists of introducing a novel indexing technique that relies on linguistic data summarization into the context of P2P systems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The cost model of the approach, as well as the simulation results have shown that the approach allows the efficient maintenance of data summaries, without incurring high traffic overhead. In addition, the cost of query routing is significantly reduced in the context of summaries.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>The paper has considered a summary service defined on the APPA's architecture. Future works have to study the extension of this work in order to be generally applicable to any P2P data management system.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>This paper has mainly studied the quantitative gain that could be obtained in query processing from exploiting data summaries. Future works aim to implement this technique on real data (not synthetic) in order to study the qualitative gain that can be obtained from approximately answering a query.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The novelty of the approach shown in the paper relies on the double exploitation of the summaries in P2P systems: data summaries allow for a semantic\u2010based query routing, and also for an approximate query answering, using their intentional descriptions.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370810932150","type":"journal-article","created":{"date-parts":[[2009,1,17]],"date-time":"2009-01-17T07:25:25Z","timestamp":1232177125000},"page":"390-410","source":"Crossref","is-referenced-by-count":0,"title":["PeerSum: a summary service for P2P applications"],"prefix":"10.1108","volume":"4","author":[{"given":"Rabab","family":"Hayek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Raschia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Valduriez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noureddine","family":"Mouaddib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2021010501464862800_b1","unstructured":"Aberer, K., Cudr\u00e9\u2010Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M. and Schmidt, R. (2003), \u201cP\u2010grid: a self\u2010organizing structured P2P system\u201d, SIGMOD Record, Vol. 32 No. 3, pp. 29\u201033."},{"key":"key2021010501464862800_b2","unstructured":"Acuna, F., Peery, C., Martin, R. and Nguyen, T. (2003), \u201cPlanetp: Using gossiping to build content addressable peer\u2010to\u2010peer information sharing communities\u201d, paper presented at: HPDC\u201012, Seattle, WA, June 22\u201024."},{"key":"key2021010501464862800_b3","unstructured":"Akbarinia, R., Pacitti, E. and Valduriez, P. (2007), \u201cData currency in replicated DHTs\u201d, SIGMOD Conference, pp. 211\u201022."},{"key":"key2021010501464862800_b4","unstructured":"Akbarinia, R., Martins, V., Pacitti, E. and Valduriez, P. (2006), \u201cDesign and implementation of APPA\u201d, in Baldoni, R., Cortese, G. and Davide, F. (Eds), Global Data Management, IOS Press, Amsterdam."},{"key":"key2021010501464862800_b5","doi-asserted-by":"crossref","unstructured":"Bechchi, M., Raschia, G. and Mouaddib, N. (2007), \u201cMerging distributed database summaries\u201d, paper presented at the ACM Conference on Information and Knowledge Management (CIKM), Lisbon, November 6\u20108.","DOI":"10.1145\/1321440.1321500"},{"key":"key2021010501464862800_b6","unstructured":"Chakravarti, A., Baumgartner, G. and Lauria, M. (2005), \u201cThe organic grid: self\u2010organizing computation on a peer\u2010to\u2010peer network\u201d, IEEE Transactions on Systems, Man, and Cybernetics, Part A, Vol. 35 No. 3, pp. 373\u201084."},{"key":"key2021010501464862800_b7","unstructured":"Crespo, A. and Molina, H. (2002), \u201cRouting indices for peer\u2010to\u2010peer systems\u201d, Proceedings of the 28th Conference on Distributed Computing Systems."},{"key":"key2021010501464862800_b8","unstructured":"Foster, I. and Iamnitchi, A. (2003), \u201cOn death, taxes, and the convergence of peer\u2010to\u2010peer and grid computing\u201d, IPTPS, pp. 118\u201028."},{"key":"key2021010501464862800_b9","unstructured":"Howell, F. and McNab, R. (1998), \u201cSimjava: a discrete event simulation package for java with the applications in computer systems modeling\u201d, paper presented at the International Conference on Web\u2010based Modelling and Simulation, San Diego, CA, January 11\u201014."},{"key":"key2021010501464862800_b10","unstructured":"International Health Terminology Standards Development Organisation (n.d.), \u201cSNOMED CT\u201d, available at: www.snomed.org\/snomedct."},{"key":"key2021010501464862800_b11","doi-asserted-by":"crossref","unstructured":"Koloniari, G., Petrakis, Y. and Pitoura, E. (2003), \u201cContent\u2013based overlay networks of XML peers based on multi\u2010level bloom filters\u201d, Proceedings of VLDB.","DOI":"10.1007\/978-3-540-24629-9_17"},{"key":"key2021010501464862800_b12","unstructured":"OGSA\u2010DAI (n.d.), \u201cWelcome to OGSA\u2010DAI\u201d, available at: www.ogsadai.org.uk."},{"key":"key2021010501464862800_b13","doi-asserted-by":"crossref","unstructured":"Oser, A., Naumann, F., Siberski, W., Nejdl, W. and Thaden, U. (2003), \u201cSemantic overlay clusters within super\u2010peer networks\u201d, Proceedings of the International Workshop on Databases, Information Systems and Peer\u2010to\u2010Peer Computing in Conjunction with the VLDB.","DOI":"10.1007\/978-3-540-24629-9_4"},{"key":"key2021010501464862800_b14","unstructured":"Ozsu, T. and Valduriez, P. (1999), Principles of Distributed Database Systems, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2021010501464862800_b15","unstructured":"Raschia, G. and Mouaddib, N. (2002), \u201cA fuzzy set\u2010based approach to database summarization\u201d, Fuzzy Sets and Systems, Vol. 129 No. 2, pp. 137\u201062."},{"key":"key2021010501464862800_b16","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R. and Shenker, S. (2001), \u201cA scalable content\u2010addressable network\u201d, paper presented at SIGCOMM, San Diego, CA, August 27\u201030.","DOI":"10.1145\/383059.383072"},{"key":"key2021010501464862800_b17","doi-asserted-by":"crossref","unstructured":"Rowstron, A. and Druschel, P. (2001), \u201cStorage management and caching in PAST, a large\u2010scale, persistent peer\u2010to\u2010peer storage utility\u201d, Proceedings of SOSP.","DOI":"10.1145\/502034.502053"},{"key":"key2021010501464862800_b18","unstructured":"Saint\u2010Paul, R., Raschia, G. and Mouaddib, N. (2005), \u201cGeneral purpose database summarization\u201d, paper presented at VLDB, Trondheim, August 29."},{"key":"key2021010501464862800_b19","unstructured":"Saroiu, S., Gummadi, P. and Gribble, S. (2002), \u201cA measurement study of peer\u2010to\u2010peer file sharing systems\u201d, paper presented at MMCN, San Jose, CA, January."},{"key":"key2021010501464862800_b20","unstructured":"Shen, H., Shu, Y. and Yu, B. (2004), \u201cEfficient semantic\u2010based content search in P2P network\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 16 No. 7, pp. 813\u201026."},{"key":"key2021010501464862800_b21","unstructured":"Tartinov, I., Ives, Z., Madhavan, J., Halevy, A., Suciu, D., Dalvi, N., Dong, X., Kadyiska, Y., Miklau, G. and Mork, P. (2003), \u201cThe Piazza peer data management project\u201d, SIGMOD Record, Vol. 32 No. 3, pp. 47\u201052."},{"key":"key2021010501464862800_b22","unstructured":"Thompson, K. and Langley, P. (1991), Concept Formation in Structured Domains, Concept Formation: Knowledge and Experience in Unsupervised Learning, Morgan Kaufmann, San Francisco, CA, pp. 127\u201061."},{"key":"key2021010501464862800_b23","doi-asserted-by":"crossref","unstructured":"Voglozin, W., Raschia, G., Ughetto, L. and Mouaddib, N. (2004), \u201cQuerying the SaintEtiQ summaries \u2013 a first attempt\u201d, paper presented at the International Conference on Flexible Query Answering Systems (FQAS), Lyon, June 24\u201026.","DOI":"10.1007\/978-3-540-25957-2_32"},{"key":"key2021010501464862800_b24","unstructured":"Wang, C., Xiao, L., Liu, Y. and Zheng, P. (2006), \u201cDiCAS: an efficient distributed caching mechanism for P2P systems\u201d, IEEE Transactions on Parallel and Distributed Systems, Vol. 17 No. 10, pp. 1097\u2010109."},{"key":"key2021010501464862800_b25","unstructured":"Yang, B. and Molina, H. (2001), \u201cComparing hybrid peer\u2010to\u2010peer systems\u201d, Proceedings of VLDB."},{"key":"key2021010501464862800_b26","unstructured":"Zadeh, L. (1965), \u201cFuzzy sets\u201d, Information and Control, Vol. 8 No. 3, pp. 338\u201053."},{"key":"key2021010501464862800_b27","unstructured":"Zadeh, L. (1975), \u201cConcept of a linguistic variable and its application to approximate reasoning \u2013 I\u201d, Information Systems, Vol. 8 No. 3, pp. 199\u2010249."},{"key":"key2021010501464862800_b28","unstructured":"Zadeh, L. (1999), \u201cFuzzy sets as a basis for a theory of possibility\u201d, Fuzzy Sets and Systems, Vol. 100, pp. 9\u201034."}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370810932150","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370810932150\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370810932150\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:11Z","timestamp":1753403051000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/4\/4\/390-410\/162729"}},"subtitle":[],"editor":[{"given":"Jean\u2010Marc","family":"Pierson","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2008,11,21]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11,21]]}},"alternative-id":["10.1108\/17427370810932150"],"URL":"https:\/\/doi.org\/10.1108\/17427370810932150","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2008,11,21]]}}}