Optimization of massive data retrieval performance based B-tree index

DOI

10.2991/amcce-15.2015.350How to use a DOI?

Keywords

Oracle 11g; B-tree index scan; massive data retrieval; performance optimization; the 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.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lihua Geng
PY  - 2015/04
DA  - 2015/04
TI  - Optimization of massive data retrieval performance based B-tree index
BT  - Proceedings of the 2015 International Conference on Automation, Mechanical Control and Computational Engineering
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/amcce-15.2015.350
DO  - 10.2991/amcce-15.2015.350
ID  - Geng2015/04
ER  -