[PDF][PDF] Analysis of B-tree data structure and its usage in computer forensics
Central European Conference on Information and Intelligent Systems, 2010•researchgate.net
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, B-trees are used to reduce the number of disk accesses.
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, B-trees are used to reduce the number of disk accesses.
Abstract
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, B-trees are used to reduce the number of disk accesses.
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果