本文選題：重復數(shù)據(jù)刪除　切入點：元數(shù)據(jù)　出處：《北京理工大學學報》2014年05期 　論文類型：期刊論文

【摘要】：根據(jù)重復數(shù)據(jù)刪除的特點,針對連續(xù)數(shù)據(jù)訪問為主的應用,設計基于B+樹的元數(shù)據(jù)索引結(jié)構(gòu);將元數(shù)據(jù)分為冷熱兩種,分別設計不同的元數(shù)據(jù)布局策略.研究結(jié)果表明,低能耗磁盤能夠保持更長時間的待機狀態(tài)以便節(jié)能,同時可以有效地減少重復數(shù)據(jù)刪除時的隨機磁盤訪問次數(shù).并且沒有額外的硬件開銷,實現(xiàn)僅在磁盤上存儲索引,而不是之前研究中的在磁盤和內(nèi)存中存儲索引.
[Abstract]:According to the characteristics of repeated data deletion, the index structure of metadata based on B-tree is designed for the application of continuous data access, and the metadata is divided into two types: hot and cold, and different metadata layout strategies are designed. Low-power disks can maintain longer standby state to save energy, and can effectively reduce the number of random disk visits when data is deleted repeatedly. There is no additional hardware overhead, so the index can only be stored on disk. Rather than storing indexes in disk and memory as previously studied.
【作者單位】： 北京理工大學計算機學院;北京物資學院信息學院;
【基金】：國家自然科學基金資助項目(61003262) 北京市“青年英才計劃”資助項目(YETP1532)
【分類號】：TP333

【參考文獻】

相關(guān)期刊論文 前2條

1 邱越峰,田增平,季文，

本文編號：1572196