{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:55:11Z","timestamp":1781110511727,"version":"3.54.1"},"reference-count":35,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>Both compression and decompression play important roles in a web service system. High compression ratio helps to save the storage, while fast decompression contributes to decreasing the response time of service. Specifically focusing on the news web service, this paper proposes a compression mechanism to improve the efficiency of compression and decompression simultaneously by taking advantage of the semantic relations among webpages. Firstly, webpages are clustered into news topics according to the similarity semantic relation among webpages. Webpages belonging to the same topic have much duplicate content, which can improve the compression ratio when using delta-compression. Secondly, associated news topics are detected with the help of multiple-semantics link network of news topics. Associated topics are compressed into the same zip file which may decrease the times of decompression according to the habit of a user\u2019s reading news on the Web. The authors apply the proposed compression mechanism to a practical news search engine and the experimental results show that it has high compression ratio and fast decompression speed as well.<\/p>","DOI":"10.4018\/ijcini.2013040104","type":"journal-article","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T09:31:28Z","timestamp":1392888688000},"page":"49-64","source":"Crossref","is-referenced-by-count":1,"title":["Improving the Compression Efficiency for News Web Service Using Semantic Relations Among Webpages"],"prefix":"10.4018","volume":"7","author":[{"given":"Xiao","family":"Wei","sequence":"first","affiliation":[{"name":"Shanghai University, Shanghai, China & Shanghai Institute of Technology, Shanghai, China & City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangfeng","family":"Luo","sequence":"additional","affiliation":[{"name":"Shanghai University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijcini.2013040104-0","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487-499)."},{"key":"ijcini.2013040104-1","unstructured":"Boldi, P., & Vigna, S. (2005). MG4J at TREC 2005. Retrieved from http:\/\/mg4j.dsi.unimi.it\/"},{"key":"ijcini.2013040104-2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390360"},{"key":"ijcini.2013040104-3","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321546"},{"key":"ijcini.2013040104-4","unstructured":"Chan, M. C., & Woo, T. Y. (1999). Cache-based compaction: A new technique for optimizing web transfer. In Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 117-125)."},{"key":"ijcini.2013040104-5","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ijcini.2013040104-6","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.96"},{"issue":"7","key":"ijcini.2013040104-7","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1002\/cpe.1530","article-title":"Analysis and modeling of the semantically associated network on the web.","volume":"22","author":"X.Chen","year":"2010","journal-title":"Concurrency and Computation"},{"key":"ijcini.2013040104-8","doi-asserted-by":"crossref","unstructured":"Cooley, R., Mobasher, B., & Srivastava, J. (1997). Web mining: Information and pattern discovery on the world wide web. In Proceedings of the 9th International Conference on Tools with Artificial Intelligence (pp. 558\u2013567).","DOI":"10.1109\/TAI.1997.632303"},{"key":"ijcini.2013040104-9","unstructured":"Cutting, D. (2009). Apache Lucene. Retrieved from http:\/\/lucene.apache.org\/"},{"key":"ijcini.2013040104-10","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868248"},{"key":"ijcini.2013040104-11","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398783"},{"key":"ijcini.2013040104-12","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.538"},{"key":"ijcini.2013040104-13","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835538"},{"key":"ijcini.2013040104-14","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"ijcini.2013040104-15","unstructured":"Haveliwala, T. H., Gionis, A., & Indyk, P. (2000). Scalable techniques for clustering the web. In Proceedings of the WebDB Workshop."},{"key":"ijcini.2013040104-16","doi-asserted-by":"publisher","DOI":"10.1145\/279310.279321"},{"key":"ijcini.2013040104-17","unstructured":"IIC. (2012). KNOWLE search engine. Retrieved from http:\/\/wkf.shu.edu.cn\/aln\/aln.htm"},{"key":"ijcini.2013040104-18","unstructured":"IIC. (2013). KNOWLE dataset. Retrieved from http:\/\/wkf.shu.edu.cn"},{"key":"ijcini.2013040104-19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013284820704"},{"key":"ijcini.2013040104-20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"ijcini.2013040104-21","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963468"},{"key":"ijcini.2013040104-22","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2010.120"},{"key":"ijcini.2013040104-23","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2094608"},{"key":"ijcini.2013040104-24","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2007.44"},{"key":"ijcini.2013040104-25","doi-asserted-by":"publisher","DOI":"10.1109\/WISE.2002.1181662"},{"key":"ijcini.2013040104-26","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718536"},{"key":"ijcini.2013040104-27","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277787"},{"key":"ijcini.2013040104-28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-86092-8"},{"key":"ijcini.2013040104-29","author":"I. H.Witten","year":"1999","journal-title":"Managing gigabytes: Compressing and indexing documents and images"},{"key":"ijcini.2013040104-30","doi-asserted-by":"publisher","DOI":"10.1145\/1010614.1010616"},{"key":"ijcini.2013040104-31","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571969"},{"key":"ijcini.2013040104-32","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"},{"key":"ijcini.2013040104-33","doi-asserted-by":"crossref","unstructured":"Yang, L., Dick, R. P., Lekatsas, H., & Chakradhar, S. (2010). Online memory compression for embedded systems. ACM Trans. Embed. Comput. Syst., 9(3), 27:1\u201327:30.","DOI":"10.1145\/1698772.1698785"},{"key":"ijcini.2013040104-34","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367550"}],"container-title":["International Journal of Cognitive Informatics and Natural Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=101817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T07:58:10Z","timestamp":1716537490000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijcini.2013040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijcini.2013040104","relation":{},"ISSN":["1557-3958","1557-3966"],"issn-type":[{"value":"1557-3958","type":"print"},{"value":"1557-3966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}