基于文件分割的二进制大对象存取算法  

Binary large object access algorithm based on file segmentation

作　　者：谢华成[1] 张昆朋[2] 范黎林[3] 刘道华[4] 

机构地区：[1]信阳师范学院网络信息与计算中心,河南信阳464000 [2]洛阳师范学院信息技术学院,河南洛阳471022 [3]河南师范大学计算机与信息技术学院,河南新乡453007 [4]信阳师范学院计算机与信息技术学院,河南信阳464000

出　　处：《计算机应用》2011年第10期2612-2616,共5页journal of Computer Applications

基　　金：河南省自然科学研究计划项目(092102210316;102102210175;112300410234);河南省教育厅自然科学研究计划项目(2011A520038);信阳师范学院青年骨干教师资助计划项目(200815)

摘　　要：海量媒体数据存储系统中,文件过大或多用户并发访问等原因会造成二进制大对象(BLOB)存储过程失效。为提高存储系统存取非结构二进制文件的可靠性和稳定性,提出并建立了BLOB存储可靠性概率模型,证明了使用数量较多的文件分块和较小的分块大小,可提高BLOB存储成功的概率。根据该模型,改进了关系数据库存储环境下的BLOB数据存取技术。通过建立基于文件分块的存储结构,提出了BLOB数据分块存储和重新装配新算法并进行了仿真实验。BLOB存取算法的仿真实验和实际应用表明,该存取算法有效降低了媒体数据存储失效的概率。In the mass media data-storage system,too large data file or multi-user concurrent access can cause the failure of storage procedure.In order to improve the stability and the reliability of storing binary data file in storage system,Binary Large Object（BLOB） storage stability probability model was proposed and established.It had been proven that using more file blocks and smaller block size can increase the probability of successful BLOB storage.This paper also studied and improved the BOLB data access technology through the storage stability probability model.By establishing the storage structure based on file segmentation,a new algorithm of storing BLOB data and reassembling BLOB block was presented.The simulation and the application show that,BLOB storage algorithm based on file segmentation reduces the probability of failure during storing media files.

关 键 词：媒体存储 二进制大对象 文件分割 存储仿真 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP311.11[自动化与计算机技术—计算机科学与技术]