如何设计高效索引

索引对数据查询起到了非常重要的作用,设计一个高效的索引对程序的运行速度起到了非常重要的作用。
利用JPA做“公共黑板”,解决了数据挖掘中hadoop的子任务无法共享数据的问题,提出了树型结构的高效算法。具体实现了kdtree的hadoop版本。 代码可以在http://svn.javaforge.com/svn/hadoopjpa/HadoopDataMining check out. 需要先注册;如果不能成功,换小写地址。 下面是ris格式的引文,存盘后可为endnote等文献管理软件导入。 TY - CHAP AU - Lai, Yang AU - ZhongZhi, Shi A2 - Shi, Zhongzhi A2 - Vadera, Sunil A2 - Aamodt, Agnar A2 - Leake, David T1 - An Efficient Data Indexing Approach on Hadoop Using Java Persistence API T2 - Intelligent Information Processing V T3 - IFIP Advances in Information and Communication Technology PY - 2010 PB - Springer Boston SN - SP - 213 EP - 224 VL - 340 UR - http://dx.doi.org/10.1007/978-3-642-16327-2_27 DO - 10.1007/978-3-642-16327-2_27 AB - Data indexing is common in data mining when working with high-dimensional, large-scale data sets. Hadoop, a cloud computing project using the MapReduce framework in Java, has become of significant interest in distributed data mining. To resolve problems of globalization, random-write and duration in Hadoop, a data indexing approach on Hadoop using the Java Persistence API (JPA) is elaborated in the implementation of a KD-tree algorithm on Hadoop. An improved intersection algorithm for distributed data indexing on Hadoop is proposed, it performs O(M+logN), and is suitable for occasions of multiple intersections. We compare the data indexing algorithm on open dataset and synthetic dataset in a modest cloud environment. The results show the algorithms are feasible in large-scale data mining. ER -
评论 14
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值