检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:鬲思尧 台宪青 崔光霁 Ge Siyao;Tai Xianqing;Cui Guangji(Suzhou Research Institute,Aerospace Information Research Institute,Chinese Academy of Sciences,Suzhou 215121,Jiangsu,China;Jiangsu Research and Development Center for Internet of Things,Wuxi 214135,Jiangsu,China)
机构地区:[1]中国科学院空天信息创新研究院苏州研究院,江苏苏州215121 [2]江苏物联网研究发展中心,江苏无锡214135
出 处:《计算机应用与软件》2023年第12期21-28,共8页Computer Applications and Software
基 金:中国科学院战略性先导科技专项A类(XDA19080203)。
摘 要:地理信息瓦片数据规模庞大,传统的关系型数据库不足以满足对瓦片数据容量、速度的支持。针对这种情况,选取HBase存储瓦片数据,在以四叉树编码作为索引进行数据存储的基础上,提出一种多层级瓦片数据索引设计方法,该算法通过“异层级再编码”的方式,使在地图中空间相邻的瓦片数据在物理存储中也尽可能相邻,以达到瓦片数据的空间连续性在物理存储中得以保持的目的;提出一种邻域预读取方法,该方法配合索引设计,以批量读取的方式预先将邻域瓦片读取至缓存。实验表明,在用户连续读取相关联的地图数据的情况下,该方法比传统的缓存算法具有更高的命中率,且比传统的数据索引设计响应更快。Geographic information tile data is so large that traditional relational databases are not sufficient to support the capacity,speed and type of tile data.In this case,HBase is selected to store tile data.On the basis of quadtree encoding as an index for data storage,a multilevel tile data index design method is proposed.The algorithm made the tile data adjacent to each other in the map as adjacent as possible in physical storage to achieve the purpose of maintaining the spatial continuity of tile data in physical storage.A neighborhood pre-reading method was proposed,which worked with index design to pre-read neighborhood tiles into the cache based on batch reading.Experiments show that this method has a higher hit ratio and faster response than traditional data index design when users continuously read the associated map data.
分 类 号:TP311.1[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.51