Application of Improved B+-Trees Algorithm in Embedded Database

Jian Pin Mao; Cai Ping Liu; Jian Xu Mao

doi:10.4028/www.scientific.net/AMR.655-657.1779

Paper Titles

Membrane Computing Model Design with Quantum-Inspired Evolutionary Algorithms
p.1761

A Trust Model Award Content Security and Rating Supervision Model
p.1765

Safety Information Dissemination Path Prediction in High-Density Vehicular Wireless Networks
p.1770

Analysis and Research of BPF Filter Based on Libpcap
p.1774

Application of Improved B+-Trees Algorithm in Embedded Database
p.1779

Automated Safety Integration Analysis of Complex System Based on Functional Model
p.1783

Search on Method of Netwok Intrusion Detection Based on Support Vector Machine with Pre-Extracting Support Vector
p.1787

A Novel Communication Model Based on SOAP and SCORM in E-Learning
p.1791

A Novel Method for Mining the Advisor-Student Relationships in Academic Social Network
p.1795

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 655-657Application of Improved B+-Trees Algorithm in...

Application of Improved B+-Trees Algorithm in Embedded Database

Abstract:

B+-trees algorithm is a high efficient and common-used data organization algorithm in database system. But B+-trees algorithm has a disadvantage of low storage utilization. This disadvantage has a bad effect especially on embedded database systems, which have limit storage. To overcome this drawback, this paper presents an improved B+-trees algorithm, and applies it to an embedded database-Berkeley DB. Experimental results show that the improved B+-trees algorithm can attain higher storage utilization at the expense of more execution time than the conventional B+-trees algorithm.