201006171 九、發明說明： 【發明所屬之技術領域】 本發明係關於一種偏斜索引樹及建立偏斜索引樹與具索 引之非均勻式資料廣播循環之方法。 【先前技術】 由於無線系統之傳輸非對稱性及使用功率限制，一般係 使用資料廣播系統（Push-based Data Broadcast System)，主 動將資料放在頻道上播放出去，由使用者之接收裝置接 收。在既有無線環境非均勻資料廣播中，Acharya (參考先 前技術文獻 S. Acharya，M. Franklin，S. Zdonik，and R. Alongso, “Broadcast Disks: Data Management for Asymmetric Communications Environments,Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 199-210, 1995·)等人的 Broadcast Disks將熱門資料放在較小且速度 快的磁碟，冷門資料放在較大且速度慢的磁碟，以達到少 數熱門資料在同一個廣播循環裡較其它資料播放較多次。 參考圖1及圓2，其顯示建立習知資料廣播循環之示意 圖。首先參考圖1，一資料組10包括複數個資料1至7,其 中依據資料出現之頻率，將複數個資料區分為複數個群組 11、12、13，每一個群組具有一相對出現頻率及至少一資 料。例如：第一群組11其相對出現頻率為四，且僅有一個 資料1 ;第二群組12其相對出現頻率為二，且包括二個資 料2、3;第三群組13其相對出現頻率為一，且包括四個資 料 4、5、6、7。 132176.doc -6- 201006171 再參考圖2,依據資料出現之頻率，由該等群組心 i2、13中取出資料儲存至習知資料廣播循環2()中。習知資 料廣播循環20包括四個區段21、2 仪“ 、23、24，每一個區段 包括二個資料’且三個資料公Sll Α άι -T* 1-1 1因貝科刀別來自不同群組。其中，第 —區段21包括資料1、2、4.笛-r? 4 ’第一區段22包括資料i、3、 5;第三區段23包括資料1% 2、6 第四區段24包括資料201006171 IX. Description of the Invention: [Technical Field] The present invention relates to a skewed index tree and a method for establishing a skewed index tree and an indexed non-uniform data broadcast loop. [Prior Art] Due to the transmission asymmetry and power limitation of the wireless system, a data-based broadcasting system (Push-based Data Broadcast System) is generally used to actively play the data on the channel and receive it by the user's receiving device. In the non-uniform data broadcasting of the existing wireless environment, Acharya (refer to the prior art documents S. Acharya, M. Franklin, S. Zdonik, and R. Alongso, "Broadcast Disks: Data Management for Asymmetric Communications Environments, Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 199-210, 1995·), etc. Broadcast Disks puts popular data on smaller and faster disks, and the unpopular data is placed on larger and slower disks. In order to achieve a small number of popular data in the same broadcast cycle, it is played more than other data. Referring to Figure 1 and circle 2, it shows a schematic diagram of establishing a conventional data broadcast cycle. Referring first to Figure 1, a data set 10 includes a plurality of data. 1 to 7, wherein the plurality of data are divided into a plurality of groups 11, 12, 13 according to the frequency of occurrence of the data, each group having a relative frequency of occurrence and at least one data. For example, the first group 11 is relatively The frequency of occurrence is four, and there is only one data 1; the second group 12 has a relative frequency of two, and includes two data 2, 3; the third group 13 has a relative frequency of one, and the packet Four materials 4, 5, 6, and 7. 132176.doc -6- 201006171 Referring again to Figure 2, according to the frequency of occurrence of the data, the data collected from the group cores i2, 13 is stored in the conventional data broadcast cycle 2 ( The conventional data broadcast cycle 20 includes four sections 21, 2 instruments ", 23, 24, each section including two materials' and three data public Sll Α άι -T* 1-1 1 The knife is from different groups. Wherein the first section 21 includes the data 1, 2, 4. flute-r? 4 'the first section 22 includes the data i, 3, 5; the third section 23 includes the data 1% 2, 6 the fourth section 24 including information
因此f知資料廣播循環2〇内之資料符合群組 中資料之相對出現頻率。例如：第一群組"内之資料以 習知資料廣播循環20中出現四次。 經由習知資料廣播循環2〇,雖可減少存取熱門資料的等 待時間，以降低平均存取等待時間―响扣⑽u㈣。 然而’為了存取資'料，使用者的接收裝置(例如：行動設 備)必須持續聽無線頻道檢查播放資料，導致大量消 動設備的電池能源，使行動設備可使用時間減少。 因此’有必要提供一種創新且具進步性的偏斜索引樹及 建立偏斜索引樹與具索引之非均勻式資料廣播循環之方 法，以解決上述問題。 【發明内容】 本發月提供種偏斜索引樹’用以儲存複數個資料，包 括·複數個區域樹及至少一個根索引節點β每一區域樹包 括至/詩知點’依據資料出現之頻率，儲存資料至該 等區域樹之資料節點中，依據資料節點之數量，該等區域 ί選擇f生地包括至少一區域索W節點，該區域索引節點連 接至二資料節點。依據資料出現之頻率，利用根索引節點 132176.doc 201006171 連接該等區域樹》 本發明又提供-種建立偏斜索引樹之方法，包括以下步 驟：⑷依據資料出現之頻率，建立複數個區域樹，每一區 域樹包括至少-資料節點，肖資科節點用以儲存資料依 據資料節點之數量，該等區域樹選擇性地包括至少一區域 索引節點，該區域索引節點連接至二資料節點；及⑻ 資料出現之頻率’建立至少一個根索引節點，用以連接該Therefore, the data in the data broadcast loop 2 matches the relative frequency of the data in the group. For example, the data in the first group " appears four times in the conventional data broadcast cycle 20. Through the conventional data broadcast loop 2, the waiting time for accessing popular materials can be reduced to reduce the average access waiting time - the buckle (10) u (four). However, in order to access the information, the user's receiving device (for example, a mobile device) must continuously listen to the wireless channel to check the playing data, resulting in a large amount of battery power of the mobile device, so that the mobile device can be used less time. Therefore, it is necessary to provide an innovative and progressive skew index tree and a method of establishing a skewed index tree and an indexed non-uniform data broadcast loop to solve the above problem. SUMMARY OF THE INVENTION The present disclosure provides a skewed index tree for storing a plurality of data, including a plurality of region trees and at least one root index node β. Each region tree includes a frequency of occurrence of the data to the poetry point. The data is stored in the data nodes of the regional trees. According to the number of data nodes, the regions 选择 select the at least one regional W node, and the regional index node is connected to the second data node. According to the frequency of the occurrence of the data, the root index node 132176.doc 201006171 is used to connect the regional trees. The invention further provides a method for establishing a skewed index tree, comprising the following steps: (4) establishing a plurality of regional trees according to the frequency of occurrence of the data. Each area tree includes at least a data node for storing data according to the number of data nodes, the area trees optionally including at least one area index node, the area index node being connected to the two data nodes; (8) The frequency of occurrence of the data 'establish at least one root index node to connect to the
等區域樹》 本發明再提供—種建立具索引之非均勻式資料廣播循環 之方法，包括以下步驟：⑷依據資料出現之頻率，建立一 非均勻式資料廣播循環，其包括複數個區段，每—區段包 括至少-資料、b)如上述建立偏斜索引樹之方法建立一 偏斜索引樹；⑷依據該非均句式資料廣播循環之資料及該 偏斜索引樹之資料節點，選擇性地取得該f料節點連接之 區域索引節點或根索引節點，並加入至該資料之前；及⑷ =所加入之區域索引節點或根索引節點中，加入相對應偏 移值 本發明之偏斜索引樹考慮制者偏斜存轉式故利用 本發明之偏斜索引樹，尋訪該偏斜索引樹較少的節點，即 可快速地找到出現頻率高之資料。並且利用本發明具索引 之非均勻式資料廣播循環之區域索引節點或根索引節點可 快速地讀取資料及減少行動接收裝置之電池能源的消耗， X減y平均的存取等待時間與聽頻道時間。 【實施方式】 132176.doc 201006171 其顯示本發明建立偏斜索引樹之方法。Equal Region Tree The present invention further provides a method for establishing an indexed non-uniform data broadcast loop, comprising the following steps: (4) establishing a non-uniform data broadcast loop including a plurality of segments according to the frequency of occurrence of the data, Each segment includes at least - data, b) a skew index tree is established by the method of establishing a skewed index tree as described above; (4) based on the data of the non-equal sentence data broadcast loop and the data node of the skew index tree, selective Obtaining the region index node or the root index node connected to the f-material node and adding it to the data; and (4) = adding the corresponding offset value to the index index node or the root index node to be added to the skew index of the present invention The tree can be used to quickly find the data with high frequency by using the skewed index tree of the present invention and searching for nodes with fewer skewed index trees. And the region index node or the root index node of the indexed non-uniform data broadcast loop can quickly read data and reduce battery energy consumption of the mobile receiving device, and the X waits for the average access waiting time and the listening channel. time. [Embodiment] 132176.doc 201006171 It shows a method for establishing a skewed index tree according to the present invention.
參考圖3至圖5， 首先參考圖3，依 31、32、33。畚一 節點 33 1、332、333、334 〇 再依據資料節點之數量，該等區域樹選擇性地包括至少 區域索引Sp點，該區域索引節點連接至二資料節點。在 本實施例中，該第一區域樹31内僅包括一資料節點， 故該第一區域樹31不具有區域索引節點。該第二區域樹Μ 内包括一資料節點321、322，故該第二區域樹具有一區域 ❷ 索引節點323連接至二資料節點321、322。 依據資料節點之數量，該等區域索引節點包括至少一低 階區域索引節點及至少一高階區域索引節點’每一個低階 區域索引節點連接至二資料節點，每一個高階區域索引節 點連接至二個低階區域索引節點或二個高階區域索引節 點。在本實施例中’該第三區域樹3 3内包括四資料節點 331、332、333、334，故該第三區域樹33具有二低階區域 索5丨節點335、336分別連接至四資料節點33 1、332、 333、334，且該第三區域樹33具有一高階區域索引節點 132176.doc -9- 201006171 337連接至二個低階區域索引節點335、336。 參考圖4及圖5，依據資料出現之頻率及區域樹之數量， 建立至少一個根索引節點，用以連接該等區域樹。並且， 依據資料出現之頻率及區域樹之數量，該等根索引節點包 括一低階根索引節點及至少一高階根索引節點，該低階根 索引節點連接至二區域樹，每一個高階根索引節點連接至 一區域樹及一低階根索引節點或一高階根索引節點。首先 ❹ 參考圖4，建立一低階根索引節點41連接第二區域樹32及 第三區域樹33’該第二區域樹32及該第三區域樹33其資料 出現之頻率為次低及最低，且第二區域樹32在該低階根索 引節點41之左側，為該低階根索引節點41之第一個子節 點。 參考圖5,建立一高階根索引節點51連接該第一區域樹 31及該低階根索引節點41，且第一區域樹31在該高階根索 引節點51之左側，為該高階根索引節點5〗之第一個子節 ❹ 點。在本實施例中，由於該第一區域樹僅具有一個資料節 點311，故該高階根索引節點51直接連接至該資料節點 311。並且，在本實施例中無其他區域樹，故建立完成本 發明之偏斜索引樹50。 本發明之偏斜索引樹50係由資料節點往上建立低階區域 索引節點或高階索引節點，再建立低階根索引節點及高階 根索引節點。並且’由於資料出現頻率最低之區域樹，其 資料節點應最多，且資科出現頻率最高之區域樹，其資料 節點應最少，故本發明之偏斜索引樹會具有如圖5所示之 132176.doc 201006171 偏斜情形。 考慮資料之偏斜存取模式，通常一般為2〇%之較熱門資 料（資料出現頻率較高）由80%之使用者存取，但8〇%之較 . 冷門資料（資料出現頻率較低）係由20%之使用者存取。故 本發明之偏斜索引樹考慮使用者偏斜存取模式利用本發 明之偏斜索引樹，尋訪該偏斜索引樹較少的節點，即可快 速地找到出現頻率高之資料。 φ 參考圖6至圖11，其顯示本發明建立具索引之非均勻式 資料廣播循環之示意圖。首先參考圖6,依據資料出現之 頻率’建立—非均自式資料錢«60,以括複數個區 段61、62、63、64,每一區段包括至少一資料。在本實施 例中，該非均勻式資料廣播循環6〇係與習知技術之該習知 資料廣播循環20相同’故在此不加敘述。在本實施例中， 第一區段包括三個資料節點611、612、613用以分別儲 存資料1、2、4，其資料出現之頻率係由高至低排列。 • 再參考圖5，利用上述建立偏斜索引樹之方法，建立一 偏斜索引樹5〇。再配合參考圖5及圖6，依據該非均勻式資 料廣播循環60之資料及該偏斜索引樹5〇之資料節點，選擇 ϋ地取彳子該資料節點連接之區域索引節點或根索引節點， 並加入至該資料之前。故並非該非均勾式資料廣播循環⑼ 之所有資料前均必須加入區域索引節點或根索引節點。 首先以該非均勻式資料廣播循環60之第一區段61之第一 個f料節點611為例說明’其對應至該偏斜索引樹％為資 料即點311。判斷該資料節點是否為所連接之區域索引節 I32176.doc •11 · 201006171 點或根索引節點之第—早 節點或根"節點，並儲取得該區域索引 中，資料節點Ml為所連接、 中。在本實施例 、，所連接之根索引節點5丨之第一 點，故將根索引節點（R)_存至一 第子知 ^ ^ ^ ^ ^ 冢$丨堆叠中。再判斷 ^索引節點或根索引節點是否具有上一階ε域 索引節點或根索引筋劻Α ^ ^ 階£域 咖益卜一 本實施例中，根索引節點 ()無上階根索引節點，故將詨帝弓丨掩ΑReferring to Figures 3 to 5, reference is first made to Figure 3, in accordance with 31, 32, 33. The node 33 1, 332, 333, 334 〇 further depends on the number of data nodes, the area trees optionally including at least a region index Sp point, the region index node being connected to the two data nodes. In this embodiment, the first area tree 31 includes only one data node, so the first area tree 31 does not have a regional index node. The second area tree includes a data node 321, 322, so the second area tree has an area 索引 the index node 323 is connected to the two data nodes 321, 322. Depending on the number of data nodes, the regional index nodes include at least one low-order region index node and at least one high-order region index node. Each low-order region index node is connected to two data nodes, and each high-order region index node is connected to two Low-order area index nodes or two high-order area index nodes. In the embodiment, the third area tree 33 includes four data nodes 331, 332, 333, and 334. Therefore, the third area tree 33 has two lower-order areas, and the nodes 335 and 336 are respectively connected to the four data. Nodes 33 1, 332, 333, 334, and the third region tree 33 has a higher-order region index node 132176.doc -9- 201006171 337 connected to two lower-order region index nodes 335, 336. Referring to FIG. 4 and FIG. 5, at least one root index node is established to connect to the area trees according to the frequency of occurrence of the data and the number of area trees. And, according to the frequency of occurrence of the data and the number of the area trees, the root index nodes include a low-order root index node and at least one high-order root index node, and the low-order root index node is connected to the second-region tree, and each high-order root index The node is connected to a region tree and a low-order root index node or a high-order root index node. First, referring to FIG. 4, a low-order root index node 41 is connected to connect the second region tree 32 and the third region tree 33'. The second region tree 32 and the third region tree 33 have the second lowest and lowest frequency of data. And the second area tree 32 is to the left of the low-order root index node 41 and is the first child node of the low-order root index node 41. Referring to FIG. 5, a high-order root index node 51 is connected to the first area tree 31 and the low-order root index node 41, and the first area tree 31 is to the left of the high-order root index node 51, and the high-order root index node 5 is The first subsection of 〗. In this embodiment, since the first area tree has only one data node 311, the high-order root index node 51 is directly connected to the data node 311. Further, in the present embodiment, there is no other area tree, so the skew index tree 50 of the present invention is established. The skew index tree 50 of the present invention establishes a low-order region index node or a high-order index node from a data node, and then establishes a low-order root index node and a high-order root index node. And 'because the area tree with the lowest frequency of occurrence of data, the data node should be the most, and the area tree with the highest frequency of occurrence of the subject has the least data node, so the skew index tree of the present invention will have 132176 as shown in Fig. 5. .doc 201006171 Skew situation. Considering the skewed access mode of the data, usually 2% of the more popular data (the frequency of the data is higher) is accessed by 80% of the users, but compared with 8%. The unpopular data (the data appears less frequently) ) is accessed by 20% of users. Therefore, the skew index tree of the present invention can quickly find the data with high frequency by using the skewed index tree of the present invention and searching for nodes with fewer skewed index trees. φ Referring to Figures 6 through 11, there is shown a schematic diagram of the present invention for establishing an indexed non-uniform data broadcast cycle. Referring first to Figure 6, a non-uniform self-contained data «60 is created based on the frequency at which the data appears, including a plurality of sections 61, 62, 63, 64, each section including at least one material. In the present embodiment, the non-uniform data broadcast loop 6 is the same as the conventional data broadcast loop 20 of the prior art, and therefore will not be described here. In this embodiment, the first segment includes three data nodes 611, 612, and 613 for storing data 1, 2, and 4, respectively, and the frequency of occurrence of the data is ranked from high to low. • Referring again to Figure 5, a skewed index tree 5〇 is created using the method described above for establishing a skewed index tree. Referring to FIG. 5 and FIG. 6 , according to the data of the non-uniform data broadcast loop 60 and the data node of the skew index tree 5, select a region index node or a root index node connected to the data node. And before joining the information. Therefore, all the data of the non-uniform data broadcast loop (9) must be added to the regional index node or the root index node. First, the first f-node 611 of the first segment 61 of the non-uniform data broadcast cycle 60 is taken as an example to illustrate that it corresponds to the skew index tree % as the point 311. Determine whether the data node is the connected region index section I32176.doc •11 · 201006171 point or the first node of the root index node or the root node, and obtain the index of the region, the data node M1 is connected, in. In this embodiment, the first point of the root index node 5 is connected, so the root index node (R)_ is stored in a stack of ^^^^^ 冢$丨. Re-judge whether the index node or the root index node has the upper-order ε domain index node or the root index 劻Α 劻Α ^ ^ £ 域 咖 咖 咖 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一 一Therefore, the Emperor’s bow will be concealed.
點(R)51取出，加入至該資：6; 根索引節 (R)614。 孩資枓知點611之前為索引節點 ^己合參考圖5及圖7，再以該非均勻式資料廣播循環60之 第一區段61之第二個資料節點612為例說明，其對應至該 偏斜索引樹50為資料節點321。在本實施例中，資料節點 32!為所連接之區域索引節點（叫323之第一子節點，故將 區域索引節點⑽323儲存至一索引堆㈣卜再判斷所取 :之區域索引節點或根索引節點是否具有上一階區域索引 即點或根索引節點，並判斷所取得之區域索引節點或根索 引節點是否為上一階區域索引節點或根索引節點之第一子 節點。在本實施例中，區域索引節點（bl)323有上一階根索 引節點（al)41，且區域索引節點（bl)323是上一階根索引節 點（al)41之第一子節點，故將該上一階根索引節點（al)41 儲存至該索引堆叠。重複上述判斷步驟，直到條件不符 合°再依據儲存至該索引堆疊80之順序，由後往前取出該 索引堆疊80之根索引節點（al)41及區域索引節點（bl)323， 依序加入至該資料gp點612之前為索引節點615、616。 132176.doc • 12· 201006171 配合參考圖5及圖8,再以該非均句式資料廣播循環⑽之 第一區段61之第三個資料節點613為例說明，重複上述之 判斷步驟，將圖5中之區域索引節點⑽爪及區域索引節 點⑼335,依序加人至圖8中該資料節點613之前為索引節 點 617、618。 配合參考圖5及圖9,再判斷該非均句式資料廣播循環6〇 之其他區段62、63及64,選擇性地取得該資料節點連接之 ❺ ϋ域索引節點或根索引節點，並加人至㈣非均勻式資料 廣播循環60之資料前。 參考圖10 ’其顯示依據本發明實施例具索引之非均句式 資料廣播循環之示意圖。在本實施例中，本發明具索引之 非均勻式資料廣播循環70包括四個區段71、72、73、74。 例如.其中第一區段71依序包括一索引節點（汉)711、一資 料節點⑴712、-索引節點（al)713、一索引節點（bi)m、 一資料節點（2)715、一索引節點（b2)7l6、一索引節點 0 (c1)717及一資料節點（4)718。 參考圖η ’於本發明具索引之非均勾式資料廣播循環7〇 所加入之區域索引節點或根索引節點中，加入相對應偏移 值。在本實施例中’該區域索引節點或根余引節點包括四 個攔位，其中第一攔位及第二攔位用以儲存該區域索引節 點或根索引節點所連接之二個下一階節點，二個下一階節 點為資料節點、區域索引節點或根索弓i節點；第三搁位及 第四攔位用以分別儲存第一棚位及第二铜位之相對應偏移 值，其係二個下一階節點相對應出現在該具索引之非均勻 132176.doc -13· 201006171 式資料廣播循環中之位置，距離該區域索引節點或根索引 節點之位置之相對應偏移值。 配合參考囷5及圖11，以本發明具索引之非均勻式資料 廣播循環70第一區段71之第一索引節點（R)711為例說明， 該索引節點711包括四個攔位，其令第一欄位及第二攔位 用以儲存該區域索引節點或根索引節點所連接之二個下一 階節點’在本實施例中，在圖5中索引節點（R)所連接之下 參 ❹ 一階節點為資料節點（1)311及根索引節點（al)41，故第一 欄位為（1);第二攔位為（al)。第三攔位及第四攔位用以分 別儲存第一攔位（1)及第二攔位（al)之相對應偏移值，其係 二個下一階節點相對應出現在該具索引之非均勻式資料廣 播循環70中之位置，距離該索引節點711之位置之相對應 偏移值。在本實施例中，第一攔位（1)係出現在該索引節點 711之下一個資料節點（1)712，故該相對應偏移值設定為 〇,儲存至第三欄位《第二攔位（al)係出現在該索引節點 711之下二個索引節點（al)713，故該相對應偏移值設定為 1，儲存至第四攔位。 依序將該具索引之非均句式資料廣播循環70之索引節點 内之欄位完成’以建立完成本發明具索引之非均 廣播循環70。 科 參考圖12，其顯示利用本發明該具索引之非均勾式資料 廣播循環之讀取資料示意圖。當使用者在 ㈣_(亦即該具索之非均勾式資料廣播 四節點)欲讀取資料⑴時，經比對可知，在 之第 132176.doc -14 - 201006171 均勻式資料廣播循環70之讀取攔位4以後之第一區段”内 之資料沒有所欲讀取之資料⑴。由於每—讀取攔位内存有 尚未播出且離目前位置最近的根索引節點之相對應偏移值 (未顯示於圖12)，故將指標直接跳至下一區段72之第一個 索引節點（R)，且由該索引節點（R)可快速地發現所欲讀取 之資料（1)在下一資料節點，故可快速地找到所欲讀取之資 料（1)。並且，在讀取攔位4與下一區段72之第一個索引節 ❺ 點（R)之間，由於沒有所欲讀取之資料（1)，使用者可以切 換接收裝置在省電模式（〇oze m〇de)，以減少平均的聽頻 道時間，減少使用者接收裝置之電池能源的消耗。 茲以模擬比較本發明具索引之非均勻式資料廣播循環與 習知技術之平均聽頻道時間及平均存取等待時間。其中習 知技術一為不加索引之非均勻式資料廣播循環（如先前技 術中敘述）；習知技術二為具彈性式索引之非均勻式資料 廣播循環（參考先前技術文獻K. L. Tan and B. C. 〇〇i，“〇n ❿ Selective Tuning in Unreliable Wireless Channels," Data and Knowledge Eng., Vol. 28, No. 2, pp. 209-231, Nov. 1998.);習知技術三為具彈性分離式索引之非均勻式資料 廣播循環（參考先前技術文獻A. Seifert and J. J. Hung， Flexlnd: A Flexible and Parameterizable Air-Indexing Scheme for Data Broadcast Systems,5, Proc. of the l〇th Conf. on Extending Database Technology, LNCS, Vol. 3 896 pp. 902-920, 2006.)。參考下表所示，本發明該具索引之非 均勻式資料廣播循環具有最佳之平均聽頻道時間，且習知 132176.doc -15, 201006171 技術一具有最差之平均聽頻道時間。 磁碟相對 頻率參數 習知技術一 習知技術二 習知技術三 本發明 74327.53~~ 359.12 27 26.57 2 75299.73 397.29 27 26.57 3 81928.3 441.6 27 26.57 4 90032.29 487.12 27 26.57 5 97211.7 531.43 27 26.57 Φ 參考圖13，其顯示本發明具索引之非均勻式資料廣播循 環與習知技術之平均存取等待時間比較圖。習知技術一至 三如上所述，由圖13可知，最佳之平均存取等待時間是習 知技術-’但本發明該|索引之非均自式資料廣播循環之 平均存取等待時間與最佳之習知技術—差不多。然而如上 表所示，習知技術一之平均聽頻道時間是最差的。因此， 本發明具索引之非均勻式資料廣播循環可快速地讀取資料 及減）行動接收裝置之電池能源的消耗，以減少平均的存 〇 取等待時間與聽頻道時間。 准上述實施例僅為說明本發明之原理及其功效，而非限 制本發明。因此，習於此技術之人士對上述實施例進行修 改及變化仍不脫本發明之精神。本發明之權利範圍應如後 述之申請專利範圍所列。 【圖式簡單說明】 圖1及圖2顯示建立習知資料廣播循環之示意圖； 圖3至圖5顯示本發明建立偏斜索引樹之示意圖； 圖6至圖11顯示本發明建立具索引之非均勻式資料廣播 132176.doc -16 · 201006171 循環之示意圖； 圖12顯示利用本發明該具索引之非均勻式資料廣播循環 之讀取資料示意囷；及Point (R) 51 is taken out, added to the capital: 6; root index section (R) 614. The child data point 611 is preceded by an index node. Referring to FIG. 5 and FIG. 7 , the second data node 612 of the first segment 61 of the non-uniform data broadcast cycle 60 is taken as an example, which corresponds to the The skewed index tree 50 is a data node 321 . In this embodiment, the data node 32! is the connected region index node (called the first child node of 323, so the region index node (10) 323 is stored to an index heap (four) and then judged: the region index node or root Whether the index node has a previous-order region index, that is, a point or a root index node, and determines whether the obtained region index node or the root index node is the first-order region index node or the first child node of the root index node. In the middle, the region index node (bl) 323 has a previous-order root index node (al) 41, and the region index node (b1) 323 is the first child node of the previous-order root index node (al) 41, so The first-order root index node (al) 41 is stored in the index stack. The above-mentioned judging step is repeated until the condition is not met, and then the root index node of the index stack 80 is taken out from the back according to the order stored in the index stack 80. Al) 41 and the regional index node (bl) 323, which are sequentially added to the data gp point 612 before the index nodes 615, 616. 132176.doc • 12· 201006171 with reference to FIG. 5 and FIG. 8, and then the non-equal sentence pattern Data broadcast The third data node 613 of the first segment 61 of the ring (10) is illustrated as an example. The above determining step is repeated, and the region index node (10) claw and the region index node (9) 335 in FIG. 5 are sequentially added to FIG. The data node 613 is preceded by the index nodes 617 and 618. Referring to FIG. 5 and FIG. 9, the other sections 62, 63, and 64 of the non-syntactic data broadcast loop are further determined to selectively acquire the data node connection. The domain index node or the root index node is added to the data of the (4) non-uniform data broadcast cycle 60. Referring to FIG. 10', a schematic diagram of a non-sequential data broadcast cycle with an index according to an embodiment of the present invention is shown. In this embodiment, the indexed non-uniform data broadcast cycle 70 of the present invention includes four segments 71, 72, 73, 74. For example, wherein the first segment 71 sequentially includes an index node (Han) 711, a Data node (1) 712, - index node (al) 713, an index node (bi) m, a data node (2) 715, an index node (b2) 716, an index node 0 (c1) 717, and a data node (4) 718. Refer to Figure η 'in the index of the present invention The corresponding index value is added to the area index node or the root index node added by the data broadcast loop. In this embodiment, the area index node or the root index node includes four blocks, of which A block and a second block are used to store two next-order nodes connected to the index node or the root index node, and the second next-order node is a data node, a region index node or a root node i node; The three-seat and the fourth-segment are respectively used to store the corresponding offset values of the first and second copper positions, and the two next-order nodes corresponding to the non-uniformity of the index 132176.doc - 13· 201006171 The position in the data broadcast loop, the corresponding offset value from the location of the index node or the root index node of the region. With reference to FIG. 5 and FIG. 11, the first index node (R) 711 of the first segment 71 of the indexed non-uniform data broadcast cycle 70 of the present invention is taken as an example. The index node 711 includes four blocks. The first field and the second block are used to store the two next-order nodes connected to the area index node or the root index node. In this embodiment, the index node (R) is connected in FIG. The first-order node is the data node (1) 311 and the root index node (al) 41, so the first field is (1); the second block is (al). The third block and the fourth block are respectively used to store corresponding offset values of the first block (1) and the second block (al), respectively, corresponding to the two next-order nodes corresponding to the index The location in the non-uniform data broadcast loop 70, the corresponding offset value from the location of the index node 711. In this embodiment, the first interceptor (1) appears in the data node (1) 712 under the index node 711, so the corresponding offset value is set to 〇, and is stored in the third field "second. The intercept (al) system appears in the two index nodes (al) 713 below the index node 711, so the corresponding offset value is set to 1, and is stored to the fourth block. The field within the index node of the indexed non-syntactic data broadcast loop 70 is sequentially completed to establish an indexed non-uniform broadcast loop 70 of the present invention. Referring to Figure 12, there is shown a schematic diagram of the read data of the indexed non-uniform data broadcast loop using the index of the present invention. When the user wants to read the data (1) in (4) _ (that is, the four nodes of the non-uniform data broadcast), the comparison can be seen in the 132176.doc -14 - 201006171 uniform data broadcast cycle 70 The data in the first segment after reading the block 4 has no data to be read (1). Since each read block memory has a corresponding offset of the root index node that has not yet been broadcast and is closest to the current position. The value (not shown in Figure 12), so the indicator jumps directly to the first index node (R) of the next segment 72, and the index node (R) can quickly find the data to be read (1) At the next data node, the data to be read (1) can be quickly found, and between the read block 4 and the first index node (R) of the next segment 72, Without the information to be read (1), the user can switch the receiving device in the power saving mode (减少oze m〇de) to reduce the average listening channel time and reduce the battery energy consumption of the user receiving device. Simulating and comparing the average of the indexed non-uniform data broadcast cycle and the prior art of the present invention Channel time and average access waiting time, wherein the prior art one is an unindexed non-uniform data broadcasting loop (as described in the prior art); the prior art 2 is a non-uniform data broadcasting loop with an elastic index ( Reference to prior art literature KL Tan and BC 〇〇i, "〇n ❿ Selective Tuning in Unreliable Wireless Channels," Data and Knowledge Eng., Vol. 28, No. 2, pp. 209-231, Nov. 1998.) The prior art 3 is a non-uniform data broadcast cycle with an elastic separate index (refer to the prior art document A. Seifert and JJ Hung, Flexlnd: A Flexible and Parameterizable Air-Indexing Scheme for Data Broadcast Systems, 5, Proc. of The l〇th Conf. on Extending Database Technology, LNCS, Vol. 3 896 pp. 902-920, 2006.). Referring to the table below, the indexed non-uniform data broadcast cycle of the present invention has the best average listening channel time, and the conventional technique 132176.doc -15, 201006171 has the worst average listening channel time. Disk Relative Frequency Parameter Known Techniques A Known Technique 2 Conventional Technology Three Inventions 74327.53~~ 359.12 27 26.57 2 75299.73 397.29 27 26.57 3 81928.3 441.6 27 26.57 4 90032.29 487.12 27 26.57 5 97211.7 531.43 27 26.57 Φ Referring to Figure 13, It shows a comparison of the average access latency of the indexed non-uniform data broadcast loop of the present invention and the prior art. The prior art one to three are as described above, and as can be seen from FIG. 13, the optimal average access latency is a conventional technique--but the average access latency and the most common non-synchronous data broadcast cycle of the index of the present invention are the most Good knowledge technology - almost. However, as shown in the above table, the average listening channel time of the prior art is the worst. Therefore, the indexed non-uniform data broadcast cycle of the present invention can quickly read data and reduce the battery energy consumption of the mobile receiving device to reduce the average access latency and listening channel time. The above-described embodiments are merely illustrative of the principles and effects of the invention, and are not intended to limit the invention. Therefore, those skilled in the art can make modifications and changes to the above embodiments without departing from the spirit of the invention. The scope of the invention should be as set forth in the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 and FIG. 2 are schematic diagrams showing the establishment of a conventional data broadcast cycle; FIG. 3 to FIG. 5 are diagrams showing the establishment of a skewed index tree of the present invention; FIGS. 6 to 11 show the creation of an indexed index of the present invention. Schematic diagram of a uniform data broadcast 132176.doc -16 · 201006171 cycle; FIG. 12 shows a schematic diagram of reading data using the indexed non-uniform data broadcast cycle of the present invention;
❷ 圖13顯示本發明具索引之非均勻式資料廣播循環與習知 技術之平均存取等待時間比較圖。 【主要元件符號說明】 1至7 資料， 10 資料組 11 第一群組 12 第二群組 13 第三群組 20 習知資料廣播循環 21 第一區段 22 第二區段 23 第三區段 24 第四區段 31 第一區域樹 311 資料節點 32 第二區域樹 33 第三區域樹 41 低階根索引節點 50 本發明之偏斜索引樹 51 高階根索引節點 60 非均勻式資料廣播循環 132176.doc •17· 201006171 61-64 區段 70 本發明具索引之非均勻式資料廣播循環 71 第一區段 72 第二區段 73 第三區段 74 第四區段 321 ' 322 資料節點 323 ❹ 低階區域索引節點 331-334 資料節點 335 > 336 低階區域索引節點 337 高階區域索引節點 611-613 資料節點 614-618 索引節點 711 索引節點（R) 712 資料節點（1) φ 713 索引節點（al) 714 索引節點（bl) 715 資料節點（2) 716 索引節點（b2) 717 索引節點（cl) 718 資料節點（4) 721 索引節點（R) 132176.doc -18-Figure 13 is a graph showing the comparison of the average access latency of the indexed non-uniform data broadcast cycle of the present invention with the prior art. [Main component symbol description] 1 to 7 data, 10 data group 11 first group 12 second group 13 third group 20 conventional data broadcast cycle 21 first sector 22 second sector 23 third sector 24 fourth sector 31 first region tree 311 data node 32 second region tree 33 third region tree 41 low-order root index node 50 skew index tree 51 of the present invention high-order root index node 60 non-uniform data broadcast loop 132176 .doc •17· 201006171 61-64 Section 70 The indexed non-uniform data broadcast loop of the present invention 71 First section 72 Second section 73 Third section 74 Fourth section 321 '322 Data node 323 ❹ Low-order region index nodes 331-334 data nodes 335 > 336 low-order region index nodes 337 high-order region index nodes 611-613 data nodes 614-618 index nodes 711 index nodes (R) 712 data nodes (1) φ 713 index nodes (al) 714 index node (bl) 715 data node (2) 716 index node (b2) 717 index node (cl) 718 data node (4) 721 index node (R) 132176.doc -18-