Pregled bibliografske jedinice broj: 484192
Analysis of B-tree data structure and its usage in computer forensics
Analysis of B-tree data structure and its usage in computer forensics // Proceedings of the 21st Central European Conference on Information and Intelligent Systems / Aurer, Boris ; Bača, Miroslav ; Schatten, Markus (ur.).
Varaždin: Fakultet organizacije i informatike Sveučilišta u Zagrebu, 2010. str. 423-428 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 484192 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Analysis of B-tree data structure and its usage in computer forensics
Autori
Koruga, Petra ; Bača, Miroslav
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 21st 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, 2010, 423-428
Skup
Central European Conference on Information and Intelligent Systems
Mjesto i datum
Varaždin, Hrvatska, 22.09.2010. - 24.09.2010
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
B-tree; computer forensic; indexing; filesystem
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Informacijske i komunikacijske znanosti
POVEZANOST RADA
Ustanove:
Fakultet organizacije i informatike, Varaždin
