首页> 外国专利> Method and apparatus for freeing memory from an extensible markup language document object model tree active in an application cache

Method and apparatus for freeing memory from an extensible markup language document object model tree active in an application cache

机译:用于从应用程序缓存中活动的可扩展标记语言文档对象模型树中释放内存的方法和装置

摘要

The present invention relates to a garbage collector that uses an LRU algorithm to free memory from an XML DOM tree active in an application cache. According to one or more embodiments of the present invention, a threshold for the amount of memory permitted to reside in an application cache is set. Then, a garbage collector removes entries from the cache until it falls below the threshold. In one or more embodiments, a node table is used. When nodes are added to the XML DOM tree in the application cache the node table is updated. When the threshold for the amount of memory permitted to reside in the application cache is exceeded, the garbage collector applies an LRU algorithm uses the node table to determine which nodes to remove from the application cache. In one embodiment, the LRU algorithm scans the node table to determine the least recently used node in the table by examining time stamp entries in the table. Then, the algorithm removes that node and repeats the process until the XML DOM tree uses less memory in the cache than the threshold.
机译:垃圾收集器技术领域本发明涉及一种垃圾收集器,其使用LRU算法从应用程序高速缓存中活动的XML DOM树中释放内存。根据本发明的一个或多个实施例,设置允许驻留在应用程序高速缓存中的存储器量的阈值。然后,垃圾收集器从高速缓存中删除条目,直到条目降至阈值以下。在一个或多个实施例中,使用节点表。将节点添加到应用程序缓存中的XML DOM树时,将更新节点表。当超过了允许驻留在应用程序缓存中的内存量的阈值时,垃圾回收器将应用LRU算法使用节点表来确定要从应用程序缓存中删除的节点。在一个实施例中,LRU算法通过检查表中的时间戳条目来扫描节点表以确定表中最近最少使用的节点。然后,该算法将删除该节点并重复该过程,直到XML DOM树在缓存中使用的内存少于阈值。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号