Analysis of B-tree data structure and its usage in computer forensics
暂无分享,去创建一个
The idea behind this article is to give an overview of B-tree data structure and show the connection between B-tree indexing technique and computer forensics. B-tree is a fast data indexing method that organizes indexes into a multi-level set of nodes, where each node contains indexed data. This technique is most commonly used in databases and file systems where it is important to retrieve records stored in a file when data is to large to fit in main memory. In that case, Btrees are used to reduce the number of disk accesses.
[1] Chris Davis,et al. Hacking Exposed Computer Forensics , 2004 .
[2] Rudolf Bayer,et al. Concurrency of operations on B-trees , 1994, Acta Informatica.