| dc.contributor.advisor | Brown, Williams | |
| dc.creator | Koreček, Martin | |
| dc.date.accessioned | 2022-04-06T11:04:28Z | |
| dc.date.available | 2022-04-06T11:04:28Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11956/148346 | |
| dc.description.abstract | Database 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 | en_US |
| dc.language | English | cs_CZ |
| dc.language.iso | en_US | |
| dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
| dc.subject | cache|strategy|database|concurrency | en_US |
| dc.subject | vyrovnávací paměť|strategie|databáze|paralelismus | cs_CZ |
| dc.title | A Comparison of Strategies for Database Caching | en_US |
| dc.type | bakalářská práce | cs_CZ |
| dcterms.created | 2021 | |
| dcterms.dateAccepted | 2021-09-10 | |
| dc.description.department | Department of Distributed and Dependable Systems | en_US |
| dc.description.department | Katedra distribuovaných a spolehlivých systémů | cs_CZ |
| dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
| dc.description.faculty | Faculty of Mathematics and Physics | en_US |
| dc.identifier.repId | 234689 | |
| dc.title.translated | Srovnání strategií pro správu vyrovnávacích pamětí pro databáze | cs_CZ |
| dc.contributor.referee | Kofroň, Jan | |
| thesis.degree.name | Bc. | |
| thesis.degree.level | bakalářské | cs_CZ |
| thesis.degree.discipline | Obecná informatika | cs_CZ |
| thesis.degree.discipline | General Computer Science | en_US |
| thesis.degree.program | Computer Science | en_US |
| thesis.degree.program | Informatika | cs_CZ |
| uk.thesis.type | bakalářská práce | cs_CZ |
| uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra distribuovaných a spolehlivých systémů | cs_CZ |
| uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Distributed and Dependable Systems | en_US |
| uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
| uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
| uk.faculty-abbr.cs | MFF | cs_CZ |
| uk.degree-discipline.cs | Obecná informatika | cs_CZ |
| uk.degree-discipline.en | General Computer Science | en_US |
| uk.degree-program.cs | Informatika | cs_CZ |
| uk.degree-program.en | Computer Science | en_US |
| thesis.grade.cs | Výborně | cs_CZ |
| thesis.grade.en | Excellent | en_US |
| uk.abstract.en | Database 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 | en_US |
| uk.file-availability | V | |
| uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra distribuovaných a spolehlivých systémů | cs_CZ |
| thesis.grade.code | 1 | |
| dc.contributor.consultant | Tůma, Petr | |
| uk.publication-place | Praha | cs_CZ |
| uk.thesis.defenceStatus | O | |
