Optimization of massive data retrieval performance based B-tree index

average transaction response time; Abstract: With the rise of the Internet Web 2.0, the paper studies a use of B-tree index technology supported by Oracle 11gin mass data retrieval. B-tree index scanning mode use the index selectivity, histogram etc to select the best execution path to improve query performance. Put forward the solutions to avoid the useless index resulted by non-equality operation, Null operation and functional operation. After the comparison and analysis of before and after optimization of Oracle Database Performance,the result shows that the average response time of the optimized Oracle database is better than before. Preface With the growing size of the database, the database, storing massive data, will take up a lot of disk space, so the query time will be extended. In the current research on query strategy optimization is mainly focused on the design for the access mode on the physical layer, relying on hardware technology and performance to achieve the aim of improving the efficiency of the query. Today many researchers have already transferred efficiency optimization to the software side, which means the huge technology space and potential of mass data query strategy