A Comparison of Strategies for Database Caching
Srovnání strategií pro správu vyrovnávacích pamětí pro databáze
bachelor thesis (DEFENDED)

View/ Open
Permanent link
http://hdl.handle.net/20.500.11956/148346Identifiers
Study Information System: 234689
Collections
- Kvalifikační práce [11322]
Author
Advisor
Consultant
Tůma, Petr
Referee
Kofroň, Jan
Faculty / Institute
Faculty of Mathematics and Physics
Discipline
General Computer Science
Department
Department of Distributed and Dependable Systems
Date of defense
10. 9. 2021
Publisher
Univerzita Karlova, Matematicko-fyzikální fakultaLanguage
English
Grade
Excellent
Keywords (Czech)
vyrovnávací paměť|strategie|databáze|paralelismusKeywords (English)
cache|strategy|database|concurrencyDatabase caching is the practice of keeping an amount of data in memory, to reduce the cost of accesses to the main storage, and thus improve the performance of a database machine. We particularly focus on two properties of database caches. Firstly, how differ- ent cache replacement policies decide what data is kept in memory and secondly, what options exist to allow parallel accesses to the cached set by multiple threads. With a lim- ited resource of access logs from real NoSQL databases in production, we will measure the performance of the discussed replacement policies. And we will measure the in-memory performance of the data structures that enable parallelism. 1