Research on Optimization of SQLite Indexing Mechanism Based on Red-Black Tree

Abstract:

SQLite has been widely applied in embedded system because of its open source and less resource consumption. A novel optimization method with Red-black tree replacing B tree in indexing mechanism in order to solve the low efficiency and large energy consumption problem when inserting and deleting data in SQLite database was proposed in the paper. The contrast test of efficiency of between red-black tree and B tree while inserting and deleting data shows that this method can effectively improve the SQLite insertion and deletion operation efficiency and reduce the energy consumption.

• Periodical: Applied Mechanics and Materials (Volumes 220-223)
• Pages: 2711-2715
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.220-223.2711
• Online since: November 2012
• Authors: Jian Wei Li, Hong Guo, Yu Bin Xu
• Keywords: Indexing Mechanism, Red-Black Tree, SQLite

References

[1] Michael Owens,The Definitive Guide to SQLite，2006.

[2] Gongye Zhou,anlan Yuan,ncai Chen，B+Tree Management Method of Object Attributes for Object-Based Storage,RFC2521,September 2007.

DOI: 10.1109/nas.2007.17

[3] http://baike.baidu.com/view/133754.htm

[4] Chen Qiangzhang. An Efficient Binary Search Tree-Red/Black Tree [J]. Journal of East China Normal University (Natural Science), 2000,3: 39-42.(In Chinese)

[5] Wang Ping. The Property Analysis of B-tree and its Application in Data Retrieval[J]. Journal of Zhejiang Ocean University, 2005.24(1):80-82.(In Chinese)

[6] http://www.Sqlite.org.

[7] Shi B.L., Ding B.K., Wang W. database system course [M]. Beijing: Higher Education Press.