A distributed caching system , including an aop api ; one of several reusable aspects offered by jboss :分布式高速緩存系統(tǒng),包括aop api ; jboss提供的幾個可重用方面之一。
The second part of this dissertation studies the peer - to - peer computing model and proposes a web caching system based on the architecture of peer - to - peer 本文的第二部分構(gòu)建了一種新型的基于peer - to - peer計算模型的分布式web緩存共享系統(tǒng)。
The expirable properties portlet service hereafter called epps works as a central caching system for portlets running under ibm websphere portal 可過期屬性porlet服務(wù)(以后稱為epps )作為一個中心緩存系統(tǒng),服務(wù)于運行在ibm websphere portal下的portlet 。
The expirable properties portlet service epps illustrates a caching system that you can use in your websphere portal applications to improve the performance 可過期屬性的portlet服務(wù)( epps )說明了您可以在您的websphere portal應(yīng)用程序中使用緩存系統(tǒng)來改進(jìn)性能。
It balances these two performance metrics . therefore , it can better estimate all the algorithms of proxy cache and the overall performance of a proxy caching system 它體現(xiàn)了陳舊率和命中率的對比程度,能很好地衡量代理緩存的各種算法的優(yōu)劣和代理緩存系統(tǒng)的整體性能。
These are not part of the basicaclentrycache interface contract because they vary depending on the type of caching system used ( eg in - memory vs disk vs cluster vs hybrid ) 這不是該接口規(guī)定的,因為這些需要根據(jù)不采用的不同的緩存系統(tǒng)來決定(緩存在內(nèi)存中,磁盤中,磁盤簇中或者是混合方案) 。
Furthermore , it also enables end - users to search less popular topics when multi - topics are involved in queries . 4 . on the basis of a self - configurable peer - peer computing model , a self - configurable web caching system is provided 利用一種自配置的peer - to - peer計算模型,給出了一種w6搜索與web緩存的若于關(guān)鍵問題研究摘要i ’ eer topeer結(jié)構(gòu)下的自配置web緩存共享系統(tǒng)。
Then the structure and the function of each component of the cache system are shown . client semantic caching is different from traditional object caching in granularity and query processing . to get better cache hits in a semantic cache , a cache replacement strategy , called lwi ( least weight item ) , is proposed 由于客戶語義緩存的粒度及基于緩存的查詢處理與傳統(tǒng)以頁或元組對象為粒度的緩存不同,因此本文提出語義緩存最小權(quán)值項lwi替換策略。
It can better incorporate these two policies and reflect web access characteristics . it also can guarantee returning the fresher data to users with the lower cost , which reflects the superiority of a combination of these two policies and improves the overall performance of a proxy caching system Acr算法的獨到之處在于將代理緩存的一致性策略和替換策略較好地結(jié)合起來,并體現(xiàn)web的訪問特性,保證以較小的代價從代理緩存中提供更新鮮的資源給用戶,體現(xiàn)了將代理緩存的一致性策略和替換策略結(jié)合起來的優(yōu)越性,同時提高了代理緩存系統(tǒng)的整體性能。
Now it has become an international main research area in which the studies on consistency policies and replacement policies always are the two directions of research , while the front of research on proxy caching techniques is how to better incorporate these two policies which results in a desirable performance of a proxy caching system 其中,一致性策略和替換策略的研究一直是提高代理緩存系統(tǒng)性能的兩個研究方向,而如何將一致性策略和替換策略有機地結(jié)合起來,以便有效地提高代理緩存系統(tǒng)的性能是代理緩存技術(shù)的研究前沿。