Aiming at the fact that traditional cache replacement strategy lacks pertinence to the semantic cache in the process of extensible markup language （XML） algebra query, a replacement strategy based on the semantic ca...Aiming at the fact that traditional cache replacement strategy lacks pertinence to the semantic cache in the process of extensible markup language （XML） algebra query, a replacement strategy based on the semantic cache contribution value is proposed. First, pattern matching rules for XML algebra query and semantic caches are given. Second, the method of calculating the semantic cache contribution value is proposed. In XML documents with four different sizes, the experimental results of time efficiency show that this strategy supports environment of the XML algebra query and it has better time efficiency than both least frequency used （LFU） and least recently used （LRU）.展开更多
基金Supported by the National Natural Science Foundation of China(60803160 and 61272110)the Key Projects of National Social Science Foundation of China(11&ZD189)+3 种基金the Natural Science Foundation of Hubei Province(2013CFB334)the Natural Science Foundation of Educational Agency of Hubei Province(Q20101110)the State Key Lab of Software Engineering Open Foundation of Wuhan University(SKLSE2012-09-07)the Wuhan Key Technology Support Program(2013010602010216)
文摘Aiming at the fact that traditional cache replacement strategy lacks pertinence to the semantic cache in the process of extensible markup language （XML） algebra query, a replacement strategy based on the semantic cache contribution value is proposed. First, pattern matching rules for XML algebra query and semantic caches are given. Second, the method of calculating the semantic cache contribution value is proposed. In XML documents with four different sizes, the experimental results of time efficiency show that this strategy supports environment of the XML algebra query and it has better time efficiency than both least frequency used （LFU） and least recently used （LRU）.
