Trees cannot lie: Using data structures for forensics purposes

P Kieseberg, S Schrittwieser… - 2011 European …, 2011 - ieeexplore.ieee.org
Today's forensic techniques for databases are primarily focused on logging mechanisms
and artifacts accessible in the database management systems (DBMSs). While log files, plan …

Using the structure of b+-trees for enhancing logging mechanisms of databases

P Kieseberg, S Schrittwieser, L Morgan… - Proceedings of the 13th …, 2011 - dl.acm.org
Today's database management systems implement sophisticated access control
mechanisms to prevent unauthorized access and modifications. This is, as an example, an …

Analysis of the internals of mysql/innodb b+ tree index navigation from a forensic perspective

P Kieseberg, S Schrittwieser… - … on Software Security …, 2019 - ieeexplore.ieee.org
In this paper we analyze the structure and generation of InnoDB-indices, as well as
navigation in this internal structures with respect to its application in digital forensics. We …

An Efficient Data Storage Technique for User Files in Cloud

R Eswari, A Vamshi, MS Sultan - … International Conference on …, 2023 - ieeexplore.ieee.org
A remote data storage service provided by cloud providers is known as cloud storage. It
substitutes an online-accessible central storage repository for the need for nearby physical …

Development of a polystore data management system for an evolving big scientific data archive

M Poudel, RP Sarode, S Shrestha, W Chu… - … Polystores, and Analytics …, 2019 - Springer
Handling large datasets can be a big challenge in case of most astronomical data
repositories. Many astronomical repositories manage images, text, key-values, and graphs …

Using internal MySQL/InnoDB B-tree index navigation for data hiding

P Fruhwirt, P Kieseberg, E Weippl - Advances in Digital Forensics XI: 11th …, 2015 - Springer
Large databases provide interesting environments for hiding data. These databases store
massive amounts of diverse data, they are riddled with internal mechanisms and data pools …

Ordinary B-tree vs NTFS B-tree: A Digital Forensics Perspectives

GS Cho - Journal of The Korea Society of Computer and …, 2017 - koreascience.kr
In this paper, we discuss the differences between an ordinary B-tree and B-tree
implemented by NTFS. There are lots of distinctions between the two B-tree, if not …

Combined indexing method in nosql databases

В Нікітін, Є Крилов, Я Корнага, В Анікін - Адаптивні системи …, 2021 - asac.kpi.ua
Any system must process requests quickly. This is one of the main conditions for a
successful system. Higher data processing rates come along with new technologies. An …

Examining NTFS file system

X Lin, X Lin - Introductory Computer Forensics: A Hands-on Practical …, 2018 - Springer
Examining NTFS File System | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

Analysis and comparison of data structures for database indexing

S Salakos - 2022 - dspace.uowm.gr
The consecutive evolution of a digital communication, remote data and services provision
and interconnection and cloud technologies environment requires the development and …