A SQLite Recovery Method for Various Primary Key and B+tree Reorganization

DOI

10.2991/cnct-16.2017.15How to use a DOI?

Keywords

SQLite, Recovery, Primary key, Free block, Free page

Abstract

Free blocks and free pages have tremendous forensic potential. Based on analyzing layouts of cells which have different types of keys, the mechanism of deletion and free blocks coalescing, a new recovering method with byte level accuracy is proposed. First, aiming at multiple keys' types and rewriting cases, improved methods mentioned in this study were used to calculate the values of renewed bytes. Then, coalescent free blocks were split dynamically. In addition, deleted data also was extracted from trunk leaf pages because of tree structure and the free page generating principle. The results indicate that the method is suitable for different deleted data. The recovery rate relative to free blocks is over 90% in the case of the integer key. The rate can also archive 89% even if the key is not the integer.

Copyright

© 2017, 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  - Jiang DU
AU  - Ming-jian LI
PY  - 2016/12
DA  - 2016/12
TI  - A SQLite Recovery Method for Various Primary Key and B+tree Reorganization
BT  - Proceedings of the International Conference on Computer Networks and Communication Technology (CNCT 2016)
PB  - Atlantis Press
SP  - 109
EP  - 115
SN  - 2352-538X
UR  - https://doi.org/10.2991/cnct-16.2017.15
DO  - 10.2991/cnct-16.2017.15
ID  - DU2016/12
ER  -