Dynamic Storage Allocation for Concurrently Readable Memory Mapped Databases (Bachelor thesis)

Σταμάτης, Ηλίας


Dynamic storage allocators are a critical component of database systems since they largely affect their performance and safety. Persistent storage allocators used by these systems are different from main memory allocators. Additional requirements such as crash resilience, concurrency control and minimized disk accesses must be satisfied. This creates a demand for efficient, fast and safe allocation of storage space in such environments. This thesis presents a theoretical design of a dynamic storage allocator for a new concurrently readable memory mapped key value database system. We initially introduce and analyze the internals of the database specifying the requirements of the allocator. Then, we perform a literature survey on dynamic memory allocation concepts, techniques and low-level mechanisms. Finally, we introduce our design proposal. Both in-memory and on-disk structures are presented along with the mechanisms that make the allocator fast, safe and resilient to system crashes
Institution and School/Department of submitter: Σχολή Τεχνολογικών Εφαρμογών / Τμήμα Μηχανικών Πληροφορικής
Keywords: readable memory;mapped databases;database systems;memory allocators
Description: Πτυχιακή εργασία--ΣΤΕΦ-Τμήμα Μηχανικών Πληροφορικής, 2018—9897
URI: http://195.251.240.227/jspui/handle/123456789/11558
Item type: bachelorThesis
Name(s) of contributor(s): Σταμάτης, Ηλίας
Submission Date: 2020-03-18T21:42:58Z
Item language: en
Item access scheme: free
Institution and School/Department of submitter: Σχολή Τεχνολογικών Εφαρμογών / Τμήμα Μηχανικών Πληροφορικής
Publication date: 2018-06-27
Bibliographic citation: Σταμάτης, Η. (2018). Dynamic Storage Allocation for Concurrently Readable Memory Mapped Databases (Πτυχιακή εργασία). Αλεξάνδρειο ΤΕΙ, Θεσσαλονίκη.
Abstract: Dynamic storage allocators are a critical component of database systems since they largely affect their performance and safety. Persistent storage allocators used by these systems are different from main memory allocators. Additional requirements such as crash resilience, concurrency control and minimized disk accesses must be satisfied. This creates a demand for efficient, fast and safe allocation of storage space in such environments. This thesis presents a theoretical design of a dynamic storage allocator for a new concurrently readable memory mapped key value database system. We initially introduce and analyze the internals of the database specifying the requirements of the allocator. Then, we perform a literature survey on dynamic memory allocation concepts, techniques and low-level mechanisms. Finally, we introduce our design proposal. Both in-memory and on-disk structures are presented along with the mechanisms that make the allocator fast, safe and resilient to system crashes
Advisor name: Ψαρράς, Νικόλαος
Examining committee: Ψαρράς, Νικόλαος
Publishing department/division: Τμήμα Μηχανικών Πληροφορικής
Publishing institution: teithe
Number of pages: 46
Appears in Collections:Πτυχιακές Εργασίες

Files in This Item:
File Description SizeFormat 
Stamatis.pdf436.43 kBAdobe PDFView/Open



 Please use this identifier to cite or link to this item:
http://195.251.240.227/jspui/handle/123456789/11558
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.