Analysis of B-tree data structure and its usage in computer forensics (CROSBI ID 566693)
Prilog sa skupa u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Koruga, Petra ; Bača, Miroslav
engleski
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.
B-tree; computer forensic; indexing; filesystem
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
423-428.
2010.
nije evidentirano
objavljeno
Podaci o matičnoj publikaciji
Central European conference on information and intelligent systems
Aurer, Boris ; Bača, Miroslav ; Schatten, Markus
Varaždin: Fakultet organizacije i informatike Sveučilišta u Zagrebu
1847-2001
Podaci o skupu
Central european conference on information and intelligent systems
predavanje
23.09.2010-25.09.2010
Varaždin, Hrvatska