天際線計算近年來被廣泛的應用在數據分析上,但隨著資料量增加、須考慮的因素更為多元或是資料類型的轉變等因素,都大大增加運算上的困難,因此越來越多人針對天際線計算去設計出更佳的演算法,以達到更佳的效能。過往在做天際線的運算時,不論是確定性資料或不確定性資料,最常使用的索引技巧大部分為R-Tree,但因為R-Tree常會有重疊的現象發生,往往造成修剪上的效率不佳,因此有人提出Z-Tree的方式,藉此成功地改善了這樣的現象。本論文所提出新的索引方式類似於Z-Tree,主要是針對索引中的節點擺放順序做改變,如此一來可以降低節點彼此間比較的次數,最後的實驗中顯示:在效能上我們的方法將隨著資料量增大或是空間維度升高明顯的提升。
Computing skyline has been widely used in data analysis in recent years, but it has greatly increased the difficulties in the computation with the variety of factors, such as increase in the amount of data, or variation in the type of data… etc., so more and more people try designing a better algorithm to achieve better performance. R-Tree was frequently used when computing skyline on whether certain data or not uncertain data, but it often has overlap between any two nodes result in the inefficiency of pruning, so it was proposed Z-Tree to improve this phenomenon. This paper propose a new way that is similar to Z-Tree, it mainly changes order of placing node in memory to achieve what reducing number of dominant test between any two nodes in high dimensions, the last experiment shows that the performance of the way will be signifi-cantly improved with the increase in the amount of data or dimension.