基于Chunk Folding的多租户云数据存储缓存管理机制
[Abstract]:With the development of network technology and the emergence of outsourcing computing and storage, a new computing model--cloud computing, is emerging. The so-called cloud computing means that the configurable shared computing resources, such as network, storage, memory, application, etc., are conveniently accessed through the network, and the supply and release of computing resources are not required or require little manual participation. As far as is concerned, SaaS (Software as a Service) is the best form of implementation of recognized cloud computing. In SaaS mode, service providers need to store data for thousands of tenants, while allocating a single database instance for each tenant requires a large amount of resources, and virtually any database instance is very low in most cases And this leads to a lot of resource waves. Fee. For this issue, a shared database shared storage mode is proposed to address resource waste such as Universal Table, Pivot Table, Chunk Foling, and so on for database instances with similar storage patterns, while in order to reduce resource waves for database instances that do not have similar storage patterns The Database Consolidation is proposed to further reduce the number of instances of the database to get economies of scale The shared storage mode and the database combination can greatly reduce the number of database instances, thus reducing the resource waste, but the cache management mechanism of the multi-tenant database built on the basis of the traditional database has the following defects or disadvantages war: (1) data block cache replacement unit The traditional database caching mechanism uses the data block as a cache unit, and under the multi-tenant shared storage architecture, any data block contains irrelevant data of a large number of other tenants, and the data block is used as a cache unit to lead to a large amount of cache resources. waste. (2) Inter-tenant cache resource points The traditional database caching mechanism lacks the concept of multi-tenancy, and for the request from the tenant, the traditional caching mechanism can cache management from the point of improving the overall performance of the database, which can lead to the resource allocation among the tenants. Extremely unreasonable, such as high-frequency access to the tenant's resources to seize the low-frequency access to the tenant, so that the SLA response time requirements of the low-frequency access tenant are not guaranteed, which is in contrast to the flexibility in the cloud computing environment and on demand characteristic phase violation. (3) Lack of cloud cache resource allocation Effective distribution mechanism. In the cloud computing environment, to get good scalability and load balance, the tenant data is divided into a plurality of data nodes for storage, and how to determine the cache contents of each node makes it possible to: (a) the SLA of the tenant The time should be met, (b) the cloud cache efficiency (the number of I/ Os) is as high as possible, the cloud cache resources consume as little as possible, and (c) each sub-node I/ O load balancing. Based on the above-mentioned problems and challenges of the multi-tenant database cache management mechanism in the cloud computing environment, combined with the characteristics of the Chunk Foling shared storage mode, from the cache replacement unit, the multi-tenant feature and the cloud cache resource association In this paper, an adaptive load dynamic cache unit generation mechanism, a cache unit I/0 valuation model and a multi-tenant are proposed. The cloud cache resource allocation mechanism. This article The main work and achievements include: (1) proposed a dynamic based on Chunk Foling The mechanism uses the physical storage mode of the tenant's request load and the tenant background Chunk Foling to share the physical storage mode of the storage structure as input, outputs a series of column (set) cache replacement units, and replaces the cache replacement unit with the data block cache replacement unit of the traditional database. can greatly reduce the delay Save and improve cache utilization. (2) give a slow The I/ O benefit valuation model of the storage unit. The model is used to query the execution plan of the optimizer and the characteristics of the Chunk Foling to obtain the I/0 benefit of each cache replacement unit, and the ratio of the benefit value to the cache space occupied by the cache replacement unit is used as the cache replacement unit. The I/0 benefit rate (half-hit rate) of each cache replacement unit is weighted according to the I/ O load condition of the current node, and the I/0 benefit rate of each cache replacement unit is weighted and corrected as a standard for measuring whether to cache the replacement unit, instead of the traditional I/ O load condition of the current node, hit rate as a measure of cache or not So that the overall benefit of the cache is improved. (3) Two types of cache allocation are given. Slightly, tenant-level and system-level cache allocation policies. The performance index of the relevant cache unit is modified. The on-line dynamic adjustment of the tenant cache allocation is realized through the tenant-level cache allocation strategy, and the system cache is realized by the system-level cache allocation policy. In order to reduce the overall cache consumption of the system, this paper presents the corresponding solution mechanism--multi-tenant cloud data storage and cache management mechanism (Multi-Tenant Memory Management for Clou) for multi-tenant databases built on the basis of the traditional database. d data storage, M3C), which is based on the tenant's SLA target to allocate cache for multi-tenancy, lowe
【学位授予单位】:山东大学
【学位级别】:硕士
【学位授予年份】:2012
【分类号】:TP333
【相似文献】
相关期刊论文 前10条
1 徐济仁,牛纪海,陈家松;WAV文件格式实例分析[J];微型机与应用;2002年03期
2 吕学强,郭军,姚天顺;英汉机器翻译系统ECT中的知识库[J];小型微型计算机系统;2004年08期
3 刘瑞祥 ,陈立亮 ,闵光国 ,袁浩扬;VESA高分辨模式下的FLIC动画演示技术[J];电子与电脑;1996年10期
4 李军;立体汉字动画的制作、编辑与特技播放[J];电脑编程技巧与维护;1998年11期
5 陈立群;INFORMIX数据库应用[J];中国金融电脑;2000年06期
6 姚建东,秦军,古志民;两种新的缓冲区溢出攻击原理及防范[J];计算机工程与应用;2003年10期
7 胡艳维;活用ASP把图片上传到数据库[J];萍乡高等专科学校学报;2003年04期
8 田新宇;马永强;王伟;;网络存储阵列中CACHE的设计[J];计算机系统应用;2011年06期
9 吉根林;Windows的多媒体世界[J];多媒体世界;1994年06期
10 董欢庆,李战怀,王彦龙,石维盛;Linux卷管理系统Snapshot技术的分析与研究[J];计算机工程;2004年02期
相关会议论文 前10条
1 刘昱;陈红;王珊;;基于Chunk的缓存优化与管理[A];第二十一届中国数据库学术会议论文集(技术报告篇)[C];2004年
2 卢艳民;焦有章;陈红;;基于语义Chunk的动态实体化视图技术[A];第二十二届中国数据库学术会议论文集(研究报告篇)[C];2005年
3 田新锋;李战怀;朱岩;;CHUNK中的多维数据压缩[A];第十八届全国数据库学术会议论文集(研究报告篇)[C];2001年
4 印莹;鲍玉斌;赵宇海;孙焕良;于戈;;Q-Dwarf——语义OLAP压缩算法Dwarf的快速实现[A];第二十一届中国数据库学术会议论文集(研究报告篇)[C];2004年
5 ;Peer-assisted Video-on-Demand with an Informed Interface of Chunk Availability[A];Proceedings 2010 IEEE 2nd Symposium on Web Society[C];2010年
6 李娜;陈红;;CWMIV:使用改进的多版本进行并发控制[A];第二十一届中国数据库学术会议论文集(技术报告篇)[C];2004年
7 张新宇;王珊;陈红;杜小勇;;基于三级索引机制的并行数据仓库的存储结构[A];第十九届全国数据库学术会议论文集(研究报告篇)[C];2002年
8 陈湘川;张达人;唐孝威;;视空间短时记忆的超广度研究[A];第八届全国心理学学术会议文摘选集[C];1997年
9 周玉;宗成庆;徐波;;基于多层过滤的统计机器翻译[A];第二届全国学生计算语言学研讨会论文集[C];2004年
10 任登君;李珩;张俐;姚天顺;;基于词对齐的双语组块对齐[A];第二届全国学生计算语言学研讨会论文集[C];2004年
相关重要报纸文章 前10条
1 重庆 甘露;在Linux中实现RAID[N];电脑报;2001年
2 广东 李锋;妙用 Cache 优化 Windows 2000[N];电脑报;2001年
3 龙哥;软件应用问答![N];中国计算机报;2004年
4 t920(ChinaUnix 安全版版主);一次Web服务器渗透测试经验(上)[N];计算机世界;2004年
5 记者 齐芳;“顿悟”是怎么发生的[N];光明日报;2011年
6 王伟锋;系统管理类[N];中国计算机报;2001年
7 徐志忠;保险行销与教练魔法[N];中国保险报;2003年
8 张友伟;3D MAX影视动画大制作(未完待续)[N];电脑报;2001年
9 于海军;内存也需要保洁[N];中国电脑教育报;2003年
10 山东省蓬莱市电业公司信息中心 孙开云;在Redhat Linux AS 4下实现软件RAID[N];计算机世界;2005年
相关博士学位论文 前4条
1 王灿;基于在线重复数据消除的海量数据处理关键技术研究[D];电子科技大学;2012年
2 万成威;基于P2P流媒体模型的流量特征分析及实时分类[D];解放军信息工程大学;2012年
3 邓亚丹;面向共享Cache多核处理器的数据库查询执行优化技术研究[D];国防科学技术大学;2009年
4 张坤;面向多租户应用的云数据隐私保护机制研究[D];山东大学;2012年
相关硕士学位论文 前10条
1 姚金成;基于Chunk Folding的多租户云数据存储缓存管理机制[D];山东大学;2012年
2 卓亚芬;ChunkedLOD—海量地形的实时绘制系统[D];浙江大学;2004年
3 赵纪元;面向文景转换的中文语义角色标注研究[D];哈尔滨工业大学;2007年
4 吉音(Girum Dagnaw Dubale);云备份系统中闪存辅助分段式布隆过滤器的研究[D];华中科技大学;2012年
5 王宇;基于多租户SaaS的模式映射技术[D];吉林大学;2012年
6 吴欣铠;结合memcached技术的社交游戏《人人城市》的设计与实现[D];南京大学;2012年
7 宋扬;基于混合传送机制的P2P节点缓存策略的研究[D];北京邮电大学;2012年
8 罗皓;RTMP媒体流嵌入SIP软交换网络的研究与实现[D];华南理工大学;2012年
9 陈香香;云计算中MapReduce性能优化及应用[D];重庆大学;2011年
10 张轶彬;分布式文件系统客户端的设计与实现[D];上海交通大学;2011年
,本文编号:2494596
本文链接:https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2494596.html