Hybrid Index Structure Based on B+ Tree
Chen Haoa
Abstract
Chen Haoa
Abstract
Considering the numerical attribute data's cross-data range retrieval needs for the files that have the property of character and number,a 2-layer hybrid index structure based on B+ tree is proposed.That data in the files is classified according to their types in the process of creating index,the first layer sets up a B+ tree index structure for the attribute of the data and the second layer constructs different index structure according to the different types of data.Experimental results show that the hybrid index structure not only adapts to the above retrieval needs,but also effectively improves the index creation speed and the space utilization.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Considering the numerical attribute data's cross-data range retrieval needs for the files that have the property of character and number,a 2-layer hybrid index structure based on B+ tree is proposed.That data in the files is classified according to their types in the process of creating index,the first layer sets up a B+ tree index structure for the attribute of the data and the second layer constructs different index structure according to the different types of data.Experimental results show that the hybrid index structure not only adapts to the above retrieval needs,but also effectively improves the index creation speed and the space utilization.
Key concepts: Computer science, B-tree, Index (typography), Tree (set theory), Data mining, Data structure, Layer (electronics), Range (aeronautics)