检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:雷婷[1]
出 处:《电讯技术》2013年第7期909-916,共8页Telecommunication Engineering
摘 要:由于高维属性和海量数据所带来的影响,数据管理需要相当高的计算负载,传统的集中索引技术已经变得不切实际。为满足数据的快速增长、海量和高维特性的要求,实现了一个高层次的分布式树形索引结构框架MRC-Tree。基于MRC-Tree框架基础上,提出了两种MKd-Tree索引结构构建方法,即OMKd-Tree和MMKd-Tree。理论分析和实验结果表明,基于MRC-Tree框架的MKd-Tree索引结构构建方法具有良好的可扩展性和较高的检索效率。Managing the high-dimensional, large-scale data needs extremely high computational load. Traditional centralized indexing techniques apparently become impractical. To address the demanding needs caused by this rapidly growing, large-scale, and high-dimensional information ecology, a high-level distributed framework for searches and computations on tree indexing structures based on Map-Reduce in the Hadoop environment, MRC- Tree (Computation based on Map-Reduce on tree structures) is achieved. And then, two MKd-Tree(Kd-Tree based on Map-Reduce) index structures based on MRC-Tree framework, OMKd-Tree (Build one distributed Kd- Tree based on Map-Reduce) and MMKd-tree (Build multiple Kd-Trees by splitting data equally based on Map- Reduce) are proposed. Finally, the theoretical analysis and experiment results illustrate that the methods are highly effective and extensible to the similarity search in high-dimensional data environment.
关 键 词:高维数据库 图数据 索引结构 分布式树形索引结构框架 Map—Reduce框架 MKd-Tree
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229