Angle-Tree: a new index structure for high-dimensional point data

2001 ◽  
Author(s):  
Daoguo Dong ◽  
Xiangyang Xue ◽  
Hangzai Luo ◽  
Yingqiang Lin
Algorithms ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 338
Author(s):  
Ting Huang ◽  
Zhengping Weng ◽  
Gang Liu ◽  
Zhenwen He

To manage multidimensional point data more efficiently, this paper presents an improvement, called HD-tree, of a previous indexing method, called D-tree. Both structures combine quadtree-like partitioning (using integer shift operations without storing internal nodes, but only leaves) and hash tables (for searching for the nodes stored). However, the HD-tree follows a brand-new decomposition strategy, which is called half decomposition strategy. This improvement avoids the generation of nodes containing only a small amount of data and the sequential search of the hash table, so that it can save storage space while having faster I/O and better time performance when building the tree and querying data. The results demonstrate convincingly that the time and space performance of HD-tree is better than that of D-tree regardless of uniform or uneven data, which are less affected by data distribution.


2005 ◽  
Vol 7 (3) ◽  
pp. 337-357 ◽  
Author(s):  
Jiyuan An ◽  
Hanxiong Chen ◽  
Kazutaka Furuse ◽  
Nobuo Ohbo

Author(s):  
Jae Soo Yoo ◽  
Myung Keun Shin ◽  
Seok Hee Lee ◽  
Kil Seong Choi ◽  
Ki Hyung Cho ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document