200821858 九、發明說明： 【發明所屬之技術領域】 一種資料備份還原方法，特別是指-種透過將來源磁碟設定 為至少-觸原資料，錢舰置資訊將還原資_存至目標磁 碟的資料備份還原方法。 【先前技術】 以往資料備份還原的方法中，都是將來源磁碟100a備份成 映像4田（丨mage)後，再以傷份完成的映像檔對第一目標磁碟働匕 進灯過原知作，如「第1圖」所示，來源磁碟鄕a劃分為第一 分割區11G與第二分割區12Q，其中第—分逐彻包含第一備 份還原資料川與第二備份還原資料112 ;第二分割區12〇中包 含第三備份還原㈣121，以往資料備份還原方法產生的映像播 會記錄第-備份還原資料川及其儲存於第一分割區彻中的位 ，、第二備份還原資料彳12及其儲存於第_分割區彻中的位址、 第三傷份還原倾121及其儲存於第二分魏㈣中的位址，於 是將備份還原資料還原至第—目標磁碟觸b時，會將第一目標 磁碟io〇b分割為第三分割區13C)與第四分割14〇，並將第一備 份還原資料111儲存至第三分割區13〇中，且儲存的位址減在 第-分割區110中之位址相同，第二備份還原資料112盘第三備 份還原資料121同樣的也會儲存至相同的位址，因此，在以往的 資料備份還原方法進行資料還原後，第—目標磁碟彻b中的資 料分佈會與來源磁碟1〇〇a完全相同。 、 也因此，上述的資料備份還原方法有著會將先前儲存在第一 200821858 :標磁碟娜中所有資料删除的問題，當使用者欲保留第一目 t磁碟麵中的所有資料時，勢必要先將第一目標磁碟獅中 =所有貧料先儲存至其他的儲存媒體上，造成制者的不便，·又 政用者較將第二還原· 112還原到第二分砸12◦時，也 ^能在所有還原資料還原到第—目標磁碟觸b後，再將第二還 :、貪料112由第三分彳3〇移動到第四分割區，造成缺少 =性關題。是故，如何在資_树，提供—種不會將原先 已，的資賴如及可改魏衫料還原齡衡的功能，成為 待解決的問題。 一 【發明内容】 卜繁於以上的問題，本發明的主要目的在於提供—種可更改資 料還原結構的資料備份縣方法，透過在資料備份時，將同分叙 區的，份倾設定為至少-個_:#料，使得在資料還原時，= ^ 乂遇原心4大小為單位設定各個還原資料所要還雜存的分割 區’域就可以將還原資料還原至與料不_分割區，藉以解 決先前技術·到之缺少靈活性的問題。此外，本發明更可以包 含備測目標磁碟的髓分佈，在儲存還原資料時，避開已有伊安 的位置，鱗絲前技铺提賴蓋財練的問題。田本 為達上述目的，本發明需藉由備份與還原兩方面達成，本 :所揭露之備份方法，包括有下列步驟：設定総磁碟中之備ς 貝枓為至少-個_資料、建立具有表祕與制各還原資料的 育料區塊之映_、儲存還原至對應㈣樞塊中' 儲存各 -貪料區塊之起始位置於表祕中；本發明賴露之還原方法，包 200821858 料下列步驟.設定映像檔巾之各㈣區塊存放之分割區以產生 Γ配f貧訊、由映像射之表讀取料料區塊切始位置， 鬼T之逖原負料至目標磁碟中。 ^關本翻之詳細特徵與實作，魏合圖示在實施方式中詳 細.兄，如下，其内容足以使任何熟f相關技藝者了解本發明之技 術内谷亚據以實施，且根據本說明㈣揭露之时及圖式，任何 熟習相關縣者可輕祕轉本發_關之目的及優點。 【實施方式】 ” 以下先說明本發明所提之映像檔2〇〇的結構，如「第2圖」 所示，映像檔2QQ中包含表福21Q、與第—龍區塊22〇a，若 是有設定兩個以上的還原資料，則會有第二資料區塊22此、…、 第N個資料區塊2〇〇n。表頭區21〇中記錄有映像才當·之樓案 資甙211及來源磁碟1〇Qa之分割結構資訊212，檔案資訊Μ] 為口、大]、的—存空間，纪錄的資料例如··映像檔2q〇之槽案大 小、映像檔中之資料區塊之總數等，但不以此為限；分割結構資 訊212包含來源磁碟1〇〇a的主要啟動磁區（Majn B〇〇t Re⑺吋 MBR)與磁碟分割表（Disk Partition Table; Partition Table; DPT) ’由於主要啟動磁區與磁碟分割表也是固定大小的資料，因 此分吾彳結構資訊212也是一個固定大小的儲存空間，由於備份時 並不疋品要備份主要啟動磁區與磁碟分割表，因此分割結構資 訊212並不一定需要存在於表頭區210中；第一資料區塊220a 中包含來源分割區221、偏移值222、目錄結構資訊223、起始 200821858 在來爾I祕225;其中來源分割區221記錄還原資料225 + ==222的分割區，所以可_定儲存空間的大 制tr 原資料225的所使用的儲她的大小， =曰财空間也是固定大小；目錄結構資訊细，會記錄目錄 14棺案之間的關係，有如「第3圖」所 '、一 原資料225會記錄第一檔案_内容、第:結=〇〇二還 與第三檔案的檔案内容，而目 ;二的彳田木内合、 ==，伽I目錄包含第二目錄、第三目錄、第一檀案、 、十、二目錄包含第三觀，但目錄結構資訊223不以上 ===❹限；起始位置224則記錄第—資料 =中的起始位置，咖定大小的儲存♦由於資料 = ==，若是以循序的方式依序讀取各個資料區塊，則不 Hr昇便可以讀取歸料區塊中之還原資料细，因此上述 :二22與起始位置224並非為必需的攔位。另外，映像播 =不=錄與儲存於還原資料225中之各域案之屬性無關 的貝枓’例如：播案儲存在來源磁碟100a中的位址等。 著以—個實施例與來解說本發明的運作與方法，並請參照 :1圖」本银明所提之可更改資料還原結構的資料備份方法 方法=圖。當使用者欲將來源磁碟1〇〇a中的資料進行備份 先會魏來源磁碟她巾的備 :二=:’第二分割區120中則是零散的目繼 木’於疋使用者將來源磁碟100a中之第一分割區11〇的資料夹 200821858 設定為第-還原資料111、資料夹之外的檔纽定為第二還原資 料112，第二分割區120的所有目錄與播案則設定為第三還原資 料121，如「第4A圖」所示，當使用者設定完成之後，就會開始 初始化（initiate)映像檔200的表頭區21〇 (步驟42〇)，在本實 施例中為在樓案資訊211中寫人映像播中的區塊資料的總二 (此總數為3 )，並預留記錄映像檔2〇〇的長度的儲存空間。若需 要備份來源韻1〇〇a社要啟動磁區與磁碟分齡的話，則會 於表頭區210中建立分y結構資訊212，並讀取來源磁碟1〇〇a 上的主要啟動磁區與磁碟分割表並贿至分割結構資訊212中 (步驟430)。在表頭區210初始化完畢後，會建立第一資料區塊 220a (步驟440) ’並在第一資料區塊22〇a的來源分割區221中 記錄第-資料區塊220a的還原資料225來自來源磁碟巧_的第 一=割區110,接著由來源磁碟·a的第—分割區彻中讀取第 1原貧料111，並將第一還原資料川的目錄結構儲存至第一 資料區塊220a的目錄結構資訊223中，再將第一原資料川 中的槽案儲存到還原資料225中（步驟45〇)。重複上述步驟相 至步驟450，將第二還原㈣112與第三還原資料121記錄至映 像槽200的第二資料區塊黑與第三倾區塊22此，最後會將 整個映傭2GG的大小寫人脖纽211巾，以完絲頭區鱗 置、。在上述的步驟410巾，若使用者未進行設定時，本發明會將 ^原磁碟100a的各個分割區中的所有目錄與赫視為—個還原 貪料來進行備份，此方式類似習知之備份還原方法。 接著請參照「第4B圖」本發酬提之可更改:賴還原結構 10 200821858 勺資科還原方去之方法流程圖。當使用者欲將經由上述過程進行 備伤而產生的映像才當2〇〇還原到第三目標磁碟同時希望將 ，份時奴的第—還原資料川、第二還原資料112、第三還原資 = 121全部還原到第二目標磁碟1〇〇c中唯—的分割區（也就是 第五刀D、彳區15G)時’可以湘設定界面來選擇各個還原資料要 存^的磁碟’例如，設定界面會偵測硬碟上的各個分割區使得使 用者之後能夠進行選擇（本實施例僅有第五分割區一個分割區）， _會掃描映像槽200中找出各师料區塊，若是各賴區塊儲 存^起始位置224與偏移值222，則可以利用各資料區塊的起始 位置224加丄偏移值222快速的找出次_個資料區躺起始位 址’右沒有’就需要將所有的資料檢查過才能找出各個資料區塊。 在找出各個資料H塊之後便會把各個魏區塊_，讓使用者可 以在對各個資料區塊分別進行設定，如「第6圖」所示，使:者 可以由資料區塊欄61Q中找到各個麵區塊，並對應的存放分割 區欄620中設定第一資料區塊22〇a、第二資料區塊2施、第^ 資料區塊220c存放至第五分割區15〇 (步驟51〇)，設定後會^200821858 IX. Description of the invention: [Technical field of invention] A method for data backup and restoration, in particular, by setting the source disk to at least-touch data, and saving the information to the target disk. Data backup and restore method. [Prior Art] In the method of data backup and restoration in the past, the source disk 100a is backed up into an image of 4 fields (丨mage), and then the image file of the first target disk is broken into the original image. Knowing that, as shown in FIG. 1, the source disk 鄕a is divided into a first partition area 11G and a second partition area 12Q, wherein the first branch includes the first backup restore data stream and the second backup restore data. 112; the second partition 12 包含 includes the third backup restore (four) 121, the image broadcast record generated by the previous data backup and restore method, the first backup backup data stream and its stored in the first partition, the second backup The restored data 彳12 and its address stored in the _divided area, the third injury reduction tilt 121 and the address stored in the second derivative (4), then restore the backup and restore data to the first target magnetic When the disc touches b, the first target disk io〇b is divided into the third partition area 13C) and the fourth partition 14〇, and the first backup restored material 111 is stored in the third partition area 13〇, and is stored. The address of the address is the same as the address in the first-divided area 110, and the second address is The copy data 112 disk third backup restore data 121 will also be stored to the same address, therefore, after the previous data backup and restore method for data restoration, the data distribution and source in the first target disk The disk 1〇〇a is identical. Therefore, the above data backup and restoration method has the problem of deleting all the data previously stored in the first 200821858: label disk Na, when the user wants to retain all the data in the first directory t disk surface, it is bound to It is necessary to first store the first target disk lion = all the poor materials to other storage media, causing the inconvenience of the maker, and the politician will restore the second reduction 112 to the second minute. , ^ can be restored after all the restored data to the first - target disk touch b, and then the second:: greed 112 from the third branch 彳 3 〇 to the fourth partition, resulting in the lack of sex. Therefore, how to provide the ability to reduce the original age, such as the original, and the ability to change the age of the Wei-shirt material, has become a problem to be solved. [Summary of the Invention] In the above problems, the main object of the present invention is to provide a data backup county method capable of changing the data restoration structure, and at the time of data backup, the same divisional area is set to at least - _: #料, so that when the data is restored, = ^ 乂 原 原 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 , , , , , , , , , , , , , , , , In order to solve the problem of the lack of flexibility of the prior art. In addition, the present invention can further include the distribution of the marrow of the target disk, and avoid the problem of the existing Ian when storing and restoring the data. For the above purposes, the present invention is achieved by both backup and restoration. The method of the present disclosure includes the following steps: setting the spare disk in the disk to at least one data. The image of the cultivating block with the secret of the table and the reduction data is stored, and the storage is restored to the corresponding position in the corresponding (4) pivot block. The starting position of the storage-grain block is in the table secret; the reduction method of the present invention is Package 200821858 The following steps are required. Set the partitions stored in each block of the image file (4) to generate the 贫 f 贫 、 、 、 、 、 、 、 、 、 、 映像 映像 读取 读取 映像 映像 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取 读取In the target disk. ^Details of the details and implementation, the Weihe diagram is detailed in the embodiment. Brother, as follows, the content is sufficient for any skilled person to understand the technology of the present invention, and according to the description (4) At the time of the disclosure and the schema, any person who is familiar with the relevant county can change the purpose and advantages of this issue. [Embodiment] Hereinafter, the structure of the image file 2〇〇 proposed by the present invention will be described. As shown in Fig. 2, the image file 2QQ includes the watch 21Q and the block block 22〇a. If two or more restored data are set, there will be a second data block 22, ..., the Nth data block 2〇〇n. In the 21st section of the header area, there is recorded the image of the building 211 and the source disk 1 〇 Qa of the split structure information 212, file information Μ] for the mouth, the big], the storage space, the recorded information such as ··························· 〇t Re(7)吋MBR) and Disk Partition Table (Partition Table; DPT) 'Because the main boot area and disk partition table are also fixed-size data, the structure information 212 is also a fixed size. The storage space is not necessarily required to back up the main boot area and the disk partition table during backup, so the split structure information 212 does not necessarily need to exist in the header area 210; the first data block 220a includes the source partition 221, offset value 222, directory structure information 223, start 200821858 in Lai I secret 225; wherein the source partition 221 records the partition of the restored data 225 + == 222, so the storage space of the large tr Information used by 225 Her size, = wealth space is also a fixed size; directory structure information is fine, will record the relationship between the directory 14 cases, like "3rd map", a source of information 225 will record the first file _ content, the first :结=〇〇二also with the file content of the third file, and the purpose; the second of the 彳田木内合, ==, the gamma I directory contains the second directory, the third directory, the first dan, the ten, the second directory Contains the third view, but the directory structure information 223 is not above === limit; the starting position 224 records the starting position in the first - data =, the storage of the coffee size ♦ due to the data = ==, if it is sequential By sequentially reading each data block, the restored data in the return block can be read without Hr, so the above: 22 and the starting position 224 are not necessary. In addition, the image broadcast = not = the address of the domain file stored in the restored data 225 is not related to the address, for example, the address stored in the source disk 100a. The operation and method of the present invention will be explained by way of an embodiment, and please refer to: Fig. 1] The data backup method of the changeable structure of the changeable data proposed by Ben Yinming Method = diagram. When the user wants to back up the data in the source disk 1〇〇a, the source of the disk will be the source of the disk: 2 =: 'The second partition 120 is a fragmented mesh.' The folder 200821858 of the first partition 11〇 in the source disk 100a is set as the first-restore data 111, the file other than the folder is set as the second restored data 112, and all the directories and broadcasts of the second partition 120 are broadcasted. The case is set as the third restored data 121. As shown in "FIG. 4A", when the user setting is completed, the header area 21 of the image file 200 is initialized (step 42), in this case. In the embodiment, the total number of the block data in the person image broadcast (the total number is 3) is written in the floor information 211, and the storage space of the length of the record image file 2 。 is reserved. If it is necessary to back up the source rhyme 1〇〇a community to start the magnetic zone and disk age, then the sub-y structure information 212 will be established in the header area 210, and the main boot on the source disk 1〇〇a will be read. The magnetic zone and the disk partition table are bribed into the split structure information 212 (step 430). After the initialization of the header area 210 is completed, the first data block 220a is created (step 440)' and the restored data 225 of the first data block 220a is recorded in the source partition 221 of the first data block 22a. The first = cutting zone 110 of the source disk, then the first raw material 111 is read from the first partition of the source disk a, and the directory structure of the first restored data stream is stored to the first In the directory structure information 223 of the data block 220a, the slot in the first original data stream is stored in the restored data 225 (step 45). Repeating the above steps to step 450, recording the second restoration (four) 112 and the third restoration data 121 to the second data block black and the third dump block 22 of the image slot 200, and finally, the entire mapping of the 2GG case The man neck 211 towel, to complete the silk head area scale. In the above step 410, if the user does not perform the setting, the present invention will treat all the directories in each partition of the original disk 100a as a backup material, which is similar to the conventional method. Backup and restore method. Please refer to "Phase 4B" for the fee to be changed: Lai Restore Structure 10 200821858 When the user wants to restore the image generated through the above process, the image is restored to the third target disk, and at the same time, it is hoped that the first-to-be-restored data, the second restored data 112, and the third Original capital = 121 all restored to the second target disk 1 〇〇 c only - the partition (that is, the fifth knife D, the 彳 area 15G) 'you can set the interface to select each of the restored data to save ^ disk For example, the setting interface detects each partition on the hard disk so that the user can select later (in this embodiment, only one partition of the fifth partition), _ scans the image slot 200 to find each division. If the block stores the start position 224 and the offset value 222, the start position 224 of each data block and the offset value 222 can be used to quickly find the next start position of the data area. The address 'No right' needs to check all the data to find out the data blocks. After finding each piece of data H, each Wei block will be set to allow the user to set each data block separately, as shown in "Figure 6," so that the data block column 61Q can be used. Each face block is found, and the corresponding data block 22a, the second data block 2, and the second data block 220c are stored in the corresponding partition area 620 to be stored in the fifth partition 15 (steps) 51〇), after setting it will ^
生-個配置資訊’如「第7A圖」所示，配置資訊不一定藉由設 定界面產生，亦可由使用者依據如「第7A圖」所示·H 行建立-赌賴，本發明會翁奴财的奴㈣7〇如成 為配置魏，但設錢之格式並不以奴f料7QQa 可表示將各紳區塊存放至設定的分舰的格私可被本發明使 在配置資訊產生之後 會跳過固定的位址至表继21〇的尾 11 200821858 端，f就是第一資料區塊22〇a起始位置開始進行還原的動作， 由於表碩區210記錄的檔案資訊211與分割結構資訊212使用的 儲存空間均為定值，因此可以錄的跳至第-資料ϋ塊220a的 起始位置，不須再經過任何的判斷。 在跳至第一資料區塊22〇a的起始位置後，會依序選擇第一 育料區塊220a至第三資料區塊22〇c。首先會選擇第一資料區塊 (v驟530) ’並由第__資料區塊22〔)a中記錄的目錄結構資 。孔223將目錄建立於第五分割區湖上，並讀取還原資料225中 的各個棺案（步驟56())，於各個檔案讀出後依據目錄結構資訊 223將各個檔案健存到正確的目錄中（步驟5叫，其中讀取與儲 存各檔案的方式（步驟56Q、步驟57Q)並不以上述為限，例如 亦可案㉟ϋ，在建立讀出的齡的目錄，最後在將讀忠 的#案儲做建立的目錄巾。重複上述之步驟至步驟仍， 將第二資料區塊㈣中的還原資料225與第三資料區塊22〇。中 的還原資料225儲存至第五分割區15〇中，如「第弘圖」所示， 如此，本發日聊可以解決在資料還鱗，無法變更還原的分割區 的問題。 本發明除了如上述之循序讀取還原資料225來進行還原之 外，本發蚊可以僅還原部份之還原㈣挪，以下將加以說明， 在^述之讀備份方法（步驟41Q至步驟)中，在資料區塊 步驟44Q)之後，在_塊中寫人資料區塊的起始位 置224與偏移值222(步驟)，而後在上述之資料還原方法（步 驟·至步驟57G)中，在選擇_ 以 12 200821858 依據起始位置224與偏移值222記算出各資料區塊的起始位址。 接著延續上面的實施例，在建立第一資料區塊22〇a後，會 在起始位置224中寫入第一資料區塊220a在映像檔200中的位 址，及在第一資料區塊220a使用的儲存空間的大小（偏移值 222)，此步驟（步驟460)與儲存第一還原資料hi至還原資料 225之步驟450沒有先後次序的關係，因此步驟450與步驟460 之順序可任意改變。而後重複步驟460，將第二資料區塊220b 與第三資料區塊220c之位址與儲存空間之大小分別寫入起始位 置224與偏移值222中。 當使用者只選擇還原第三資料區塊220c時，僅需要設定第三 資料區塊220c存放之分割區（步驟51〇)，不需設定第一資料區 塊220a與第二資料區塊220b存放之分割區，則配置資訊會如「第 7B圖」的設定資料700b所示，接著本發明會讀取第一資料區塊 22Qa之起始位址224與偏移值222，並將兩者相加以得到第二資 料區塊220b之起始位址，再次相加第二資料區塊22〇b之起始位 址224與偏移值222，即可得到第三資料區塊220c之起始位址， 如此即可選擇第三資料區塊22〇c (步驟530)。 此外，在上述的資料還原的過程中，在還原資料225中的各 個檔案儲存至第五分割區150 (步驟570)之前，本發明會先偵 測第五分割區上的檔案分布（步驟55〇)，在儲存檔案時，便會避 開肩指案使用的位置，避免將已經存在的檔案覆蓋，如此即可解 決在資料還原時，原先已存在於第五分割區15〇上的資料會被還 原資料覆蓋的問題。上述偵測檔案分布之方法可以由檔案管理資 13 200821858 λ中所記錄的檔案位址得知，又或者可直接掃描目標分割區中已 被使用的位址，均與3|知之還原6刪除之财之軟體所使用的方 法相似，故在此不多加描述。 而在選擇要進行備份的資料區塊（步驟530)之後，例如選 擇第讀區塊220a，本發明更會細第一資料區塊220a中的 還原資料225所要還原的第二目標磁碟1,的第五分割區15〇 的夺里tc否多於第—資料區塊22Qa中所記錄的偏移值222(步驟 54〇)來判斷第一還原資料111是否可存入第五分割區150,若是 則逛原第一還原資料至第五分割區15〇中，若否則中止資料 是原’或疋略過第-运原資料in的還原，還原下—個資料區塊 的還原資料225。 又右使用者欲將第一資料區塊220a、第二資料區塊22〇b、 第三資料區塊220c分別還原到目標磁碟11〇d之第六分割區 彻第七刀告|]區170、第八分割區彻，只須要在步驟⑽中^ 行相對應的設定，本發明便會重複上述的步驟53〇至步驟， 將第-資料區塊220a、帛二資料區塊220b、第三資料區塊，22〇c 刀別還原到目標磁碟11〇d之第六分割區wq、第七分割區"ο、 第八分割區180，如「第5B圖」所示。 在上述的步驟510中使用者若不設定各還騎料的存放的分 割區，則在步驟560時，本發明還會讀出第一資料區塊22〇a中 的遇原貧料220的來源分割區221，如此在儲存還原資料225(步 驟570)時，便會將檔案儲存到來源分割區221所記錄的分割區 t，在此實施例中即為第三目標磁碟100d的第一個分割區，也 14 200821858 就是第六分割區跡因此第二資料區塊22此中的還原資料奶 也會儲存至第六分割區彻、第三資料區塊22Gc中的還原資料 則曰儲存至弟二目標磁碟彳_的第二個分観，也就是 分割區170。 的曰=日猶了可·來源磁碟觸a巾的備份龍還原至且他 ==碟之外，還可以在備份時將來源磁碟彻a的分割結構 貝…r至映像棺200的表頭區21〇的分割結構資訊扣中& =4%)，使得在使用者將目標磁碟還原成與目標磁碟完全相同 ^可以直接更新目標磁碟的分繼構資 將還原資料225還原的步㈣。至步娜^ 育訊的方法並非本發明之重點，且更新 特定軟體使用，例如 用軟體，故恤乡^ 娜嶋寵大小之應 雖然本發咖前述之触實施 定本發明，任何目料縣，林齡本㈣^用= 内’所為之更動與潤飾，均屬本發 圍 準。 圍顧本㈣書_之_料機_界定者為 【圖式簡單說明】 第1圖係習知之資料傷份還原方法示意圖。 22圖係本發明所提之映像檔之結構示意圖。 =圖係本翻⑽峨之目聽構示意圖。 弟圖係本發明所提之可更改資料還原結構的資料備份方 15 200821858 法之方法流程圖。 第4B圖係本發明所提之可更改資料還原結構的資料還原方 法之方法流程圖。 第5A圖係本發明實施例所提之資料備份還原方法示意圖。 第5B圖係本發明實施例所提之資料備份還原方法完成後之 示意圖。 第6圖係本發明實施例所提之設定界面示意圖。 第7A圖係本發明實施例所提之設定資料之格式。 第7B圖係本發明實施例所提之設定資料之格式。 [主要元件符號說明】 100a 來源磁碟 100b 第一目標磁碟 100c 第二目標磁碟 100d 第三目標磁碟 110 第一分割區 120 弟二分割區 130 第三分割區 140 第四分割區 150 第五分割區 160 第六分割區 170 第七分割區 180 第八分割區 200 映像檔 16 200821858 210 表頭區 211 檔案資訊 212 分割結構資訊 220a 第一資料區塊 220b 第二資料區塊 220c 第三資料區塊 220η 第Ν資料區塊 221 來源分割區 222 偏移值 223 目錄結構資訊 224 起始位置 225 還原資料 300 目錄結構 610 資料區塊欄 620 仔放分割區搁 700a 設定資料 700b 設定資料 步驟410設定還原資料 步驟420初始化表頭區 步驟430儲存分割結構資訊 步驟440建立資料區塊 步驟450儲存還原資料至資料區塊 步驟460儲存資料區塊之起始位置與偏移量 17 200821858 步驟510 步驟520 步驟530 步驟540 步驟550 步驟560 步驟570 設定貧料區塊存放之分割區 更新分割結構資訊 選擇資料區塊 偵測分割區是否可存入還原資料 偵測檔案分布 讀取還原資料 儲存資料區塊中之還原資料 18The configuration information is as shown in Figure 7A. The configuration information is not necessarily generated by the setting interface. The user can also create a gambling based on the H line as shown in Figure 7A. Slave slaves (4) 7 〇 成为 成为 成为 , , , , , , , , , , , , , , , , , , , , , , , , , , 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 Skip the fixed address to the end of the 11th corner of the 21st 2121, the f is the first data block 22〇a starting position to start the restoration action, because the file information 211 and segmentation structure information recorded in the table area 210 The storage space used by 212 is a fixed value, so it can be recorded to jump to the starting position of the data block 220a without any further judgment. After jumping to the starting position of the first data block 22〇a, the first breeding block 220a to the third data block 22〇c are sequentially selected. First, the first data block (v. 530)' is selected and the directory structure recorded in the __data block 22[)a is used. The hole 223 establishes the directory on the fifth partition lake, and reads each file in the restored data 225 (step 56 ()), and after the files are read out, the files are saved to the correct directory according to the directory structure information 223. Medium (step 5 is called, wherein the manner of reading and storing each file (step 56Q, step 57Q) is not limited to the above, for example, it can also be 35, in the directory of the read age, and finally in the reading #案存进行的目录巾. Repeat the above steps to the step, still, the restored data 225 in the second data block (4) and the third data block 22〇. The restored data 225 is stored in the fifth partition 15 In the middle, as shown in the "Hiroshi", this can solve the problem that the data is still scaled and the restored partition cannot be changed. The present invention performs the restoration in addition to the sequential read and restore data 225 as described above. In addition, the present mosquito can only restore part of the reduction (four), as will be explained below, in the read backup method (step 41Q to step), after the data block step 44Q), write in the _ block The starting position of the data block 224 and The value 222 is shifted (step), and then in the above-mentioned data restoration method (step to step 57G), the start address of each data block is calculated according to the start position 224 and the offset value 222 at the selection _ 12 200821858. . Following the above embodiment, after the first data block 22a is created, the address of the first data block 220a in the image file 200 is written in the start position 224, and in the first data block. The size of the storage space used by 220a (offset value 222), this step (step 460) has no prioritized relationship with the step 450 of storing the first restored data hi to the restored material 225, so the order of steps 450 and 460 can be arbitrary. change. Then, step 460 is repeated to write the addresses of the second data block 220b and the third data block 220c and the size of the storage space into the start position 224 and the offset value 222, respectively. When the user only selects to restore the third data block 220c, only the partition stored in the third data block 220c needs to be set (step 51〇), and the first data block 220a and the second data block 220b need not be set to be stored. The partitioning area, the configuration information will be as shown in the setting data 700b of "FIG. 7B", and then the present invention will read the starting address 224 of the first data block 22Qa and the offset value 222, and the two will be The start address of the second data block 220b is obtained, and the start address 224 and the offset value 222 of the second data block 22〇b are added again to obtain the start bit of the third data block 220c. Address, so that the third data block 22〇c can be selected (step 530). In addition, in the above data restoration process, before the files in the restored material 225 are stored in the fifth partition 150 (step 570), the present invention first detects the file distribution on the fifth partition (step 55). ), when storing the file, it will avoid the position used by the shoulder finger to avoid overwriting the existing file, so that when the data is restored, the data originally existing in the fifth partition will be Restore the problem of data coverage. The method for detecting the distribution of the file may be known from the file address recorded in the file management resource 13 200821858 λ, or may directly scan the used address in the target segment, and all are deleted with 3| The methods used by the software are similar, so there is no description here. After selecting the data block to be backed up (step 530), for example, selecting the read block 220a, the present invention further reduces the second target disk 1 to be restored by the restored data 225 in the first data block 220a. Whether the fifth partition 15 〇 is less than the offset value 222 recorded in the first data block 22Qa (step 54 〇) to determine whether the first restored data 111 can be stored in the fifth partition 150, If yes, then visit the original first restored data to the fifth partition 15 ,, if otherwise the data is the original 'or 疋 疋 第 第 运 运 运 运 运 运 第 — — — — — — — — — — — — — — — — — — — — — — The right user wants to restore the first data block 220a, the second data block 22〇b, and the third data block 220c to the sixth partition of the target disk 11〇d. 170, the eighth partition is complete, only need to perform the corresponding setting in step (10), the present invention repeats the above steps 53 to the step, the first data block 220a, the second data block 220b, the first The three data blocks, 22〇c, are restored to the sixth partition wq of the target disk 11〇d, the seventh partition "ο, the eighth partition 180, as shown in "5B". In the above step 510, if the user does not set the partition of each stored material, then in step 560, the present invention also reads the source of the poor material 220 in the first data block 22a. The partition 221, when storing the restored material 225 (step 570), stores the file in the partition t recorded by the source partition 221, which is the first of the third target disk 100d in this embodiment. The partition, also 14 200821858 is the sixth partition, so the second data block 22, the restored data milk will also be stored in the sixth partition, the third data block 22Gc in the restored data is stored in the brother The second branch of the second target disk 彳 _, that is, the partition 170.曰 日 日 日 日 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源 来源The segmentation structure information of the header area 21扣 is &=4%), so that the user restores the target disk to be exactly the same as the target disk. ^ The direct configuration of the target disk can be directly updated to restore the restored data 225. Step (4). It is not the focus of the present invention, and the use of specific software is updated, for example, using software, so the size of the shirt should be the same as that of the present invention. Lin Lingben (four) ^ use = inside 'changes and retouching, are subject to this issue. Wrapping the book (4) _ _ material machine _ defined by [simplified description of the diagram] Figure 1 is a schematic diagram of the data reduction method of the conventional knowledge. Figure 22 is a schematic view showing the structure of the image file proposed by the present invention. = The figure is a schematic diagram of the visual structure of the (10) 。. The figure is a data backup method of the changeable data restoration structure proposed by the present invention. 15 200821858 Method flow chart of the method. Fig. 4B is a flow chart showing the method of the data restoration method of the changeable data restoration structure proposed by the present invention. FIG. 5A is a schematic diagram of a data backup and restoration method according to an embodiment of the present invention. FIG. 5B is a schematic diagram of the data backup and restoration method proposed by the embodiment of the present invention. Figure 6 is a schematic diagram of a setting interface proposed by an embodiment of the present invention. Figure 7A is a format of the setting data proposed by the embodiment of the present invention. Figure 7B is a format of the setting data proposed by the embodiment of the present invention. [Main component symbol description] 100a source disk 100b first target disk 100c second target disk 100d third target disk 110 first divided area 120 second divided area 130 third divided area 140 fourth divided area 150 Five partitions 160 sixth partition 170 seventh partition 180 eighth partition 200 image file 16 200821858 210 header area 211 file information 212 split structure information 220a first data block 220b second data block 220c third data Block 220η Dimension data block 221 Source partition 222 Offset value 223 Directory structure information 224 Start position 225 Restore data 300 Directory structure 610 Data block column 620 Place the partition 700a Setting data 700b Setting data Step 410 Setting Restore Data Step 420 Initialize Header Area Step 430 Store Split Structure Information Step 440 Create Data Block Step 450 Store Restore Data to Data Block Step 460 Store Data Block Start Position and Offset 17 200821858 Step 510 Step 520 Step 530 Step 540 Step 550 Step 560 Step 570 Set the partition update of the poor material block storage Cut structure information Select data block to detect whether the partition can be saved in the restored data. Detect the file distribution. Read the restored data. Save the restored data in the data block. 18