计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (22): 162-165.DOI: 10.3778/j.issn.1002-8331.2008.22.048

• 数据库、信号与信息处理 • 上一篇    下一篇

一种基于四叉树的空间数据缓存策略

李东军1,2,曾国荪1,2   

  1. 1.同济大学 计算机科学与技术系,上海 201804
    2.国家高性能计算机工程技术中心 同济分中心,上海 201804
  • 收稿日期:2007-03-06 修回日期:2008-06-02 出版日期:2008-07-11 发布日期:2008-07-11
  • 通讯作者: 李东军

Spatial data buffer policy based on quadtree

LI Dong-jun1,2,ZENG Guo-sun1,2   

  1. 1.Department of Computer Science and Technology,Tongji University,Shanghai 201804,China
    2.Tongji Branch,National Engineering & Technology Center of High Performance Computer,Shanghai 201804,China
  • Received:2007-03-06 Revised:2008-06-02 Online:2008-07-11 Published:2008-07-11
  • Contact: LI Dong-jun

摘要: 提出了以四叉树作为缓存数据结构,结合广泛应用的LRU和LFU算法,给出了一种高效的缓存策略—基于四叉树的空间数据缓存策略,并详细描述了缓存框架和缓存策略。提出的缓存策略充分考虑了空间数据访问所具有的时间局部性和空间局部性,兼有LRU和LFU算法的优点。最后设计了空间数据请求模型,通过实验对算法的有效性进行了验证。

关键词: 四叉树, 空间数据, 缓存策略

Abstract: This paper presents a quadtree as the buffer data structure,improves and combines LFU and LRU algorithm,gives an efficient buffer strategy-spatial data buffer strategy based on quadtree,depicts a detailed description of buffer frameworks and strategies.This buffer strategy takes into account temporal locality and spatial locality of the spatial data access,which are considered by both LFU and LRU algorithm.Finally,this paper designs the spatial data accessing model,then verifies the effectiveness of the method.

Key words: quadtree, spatial data, buffer strategy