Optimization of massive data retrieval performance based B-tree index
Lihua Geng · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2015
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. PrefaceWith 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.Timing and indexed data columns are the important factors affecting the index's reasonableness.Height of almost all the B-tree indexes is 2 or 3, so to find a key in the index usually takes only two or three times I /O [1].The one kind of index scan mode which has pertinence includes index uniqueness scan, index range scan, index full scan and index fast full scan [2], so you can choose different indexes timing depending on the various situations [3].From an efficiency point of view, if you access, in the table, a small part of the data, the use of index-scan method will be more efficient; if you access the most or even full of the table, using full-table-scan approach is more successful [4].Let index inherits storage attributes of table space .whenyou create the table space, you do not need to manage the storage properties of each index structure, effectively reducing the workload of the database administrator [5].Before the implementation of Oracle SQL, first determine the execution plan for SQL statement.Execution plan includes two aspects: to determine the data scan path and determine the data collection and solution approach [6].In this paper, we will achieve the purpose of optimizing the performance of massive data retrieval through the study of the Oracle database indexing technology.