NPA:实时数据仓库中海量数据的增强分区方法

Jie Song, Y. Bao
{"title":"NPA:实时数据仓库中海量数据的增强分区方法","authors":"Jie Song, Y. Bao","doi":"10.1109/ITCS.2010.5581277","DOIUrl":null,"url":null,"abstract":"In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. Database partitioning technique which adopts ???divide and conquer??? method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the real-time data warehouse.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"NPA: Increased Partitioning Approach for Massive Data in Real-Time Data Warehouse\",\"authors\":\"Jie Song, Y. Bao\",\"doi\":\"10.1109/ITCS.2010.5581277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. Database partitioning technique which adopts ???divide and conquer??? method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the real-time data warehouse.\",\"PeriodicalId\":166169,\"journal\":{\"name\":\"2010 2nd International Conference on Information Technology Convergence and Services\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Conference on Information Technology Convergence and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCS.2010.5581277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Information Technology Convergence and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCS.2010.5581277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

在许多商业和科学数据仓库中,不仅几何级数的数据量不断增长,而且对实时性的要求也越来越高。数据库分区采用了哪些技术??分而治之?该方法可以有效地简化管理海量数据的复杂性,提高系统的性能,特别是范围划分。传统的范围分区方法由于没有增加分区算法,给系统带来了较大的负担,因此不适应实时数据仓库分区。为了提高分区算法的速度,对现有的分区技术进行了深入的研究,在允许每个分区范围内数据量波动的基础上,提出了三种有效的海量数据范围分区算法。实验和应用表明,该算法对实时数据仓库中的表进行分区和重分区是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
NPA: Increased Partitioning Approach for Massive Data in Real-Time Data Warehouse
In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. Database partitioning technique which adopts ???divide and conquer??? method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the real-time data warehouse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信