大型空間資料庫點物件之組織及視窗內物件快速搜尋法

• Main Author: 鄧慶原
• Other Authors: 黃博惠
• Format: Others
• Language: zh-TW
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/31741273401985361327

碩士 === 國立中興大學 === 應用數學系 === 87 === In the thesis, we proposed an improved dynamic index structure, called the G+-tree, for multidimensional data. Kumar proposed the G-tree in 1994, combining the features of both grids and B-trees, to organize a large number of multidimensional data. The main differences between G+-tree and G-tree are the coding rule of partitions. The coding rule of G+-tree can easily find the neighboring partitions. Consequently, the performance of range query processing becomes more efficient. Through extensive experiment, we demonstrate that G+-tree is indeed superior to G-tree in spatial database construction and range query processing.