LD_B~+ Tree: DBMS Index Structure over Flash Memory Storage Systems

Flash memory has been widely used in the storage system.Most researches mainly focuses on the file system,However,DBMS has more fine-granularity updates.Considering a wide range of flash memory devices have far different access characteristics,a new DBMS index structure,referred to as LD_B+ tree,is proposed in the paper,which redefines the basic indexing operation such as retrieval,insertion,deletion,and so on.LD_B+ tree mainly uses node translation table and logging buffer to maintain the indexing structure.A set of simulation experiments was conducted and the results showed that the LD_B+ tree outperformed the existing index structure 6%-63% under different workloads and flash packages.