dc.contributor.advisor | Koupil, Pavel | |
dc.creator | Čorovčák, Martin | |
dc.date.accessioned | 2024-11-29T00:37:18Z | |
dc.date.available | 2024-11-29T00:37:18Z | |
dc.date.issued | 2024 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11956/192088 | |
dc.description.abstract | Prı ́chod Vel'ky ́ch Da ́t pouka ́zal na obmedzenia relac ̌ny ́ch databa ́z pri spracovanı ́vel'ky ́ch datasetov, c ̌o viedlo k na ́rastu NoSQL databa ́z. Z tohto do ̂vodu sa DBMS benchmarking stal kl'u ́c ̌ovy ́m pre hodnotenie vy ́konnosti a celkovy ́ rozhodovacı ́ proces. Ta ́to pra ́ca porovna ́va relac ̌ne ́ (MySQL, SQLite), grafove ́ (Neo4j, ArangoDB), doku- mentove ́ (MongoDB) a stl ́pcovo-orientovane ́ (Cassandra) databa ́zy. Analyzujeme vyja- drovaciu silu ich dopytovacı ́ch jazykov a efektivitu poc ̌as behu pri ro ̂znych vel'kostiach da ́t. Dospeli sme k za ́veru, z ̌e neexistuje z ̌iadne ries ̌enie "c ̌ı 'slo jeden" pre vs ̌etky prı ́pady pouz ̌itia. Vy ́ber za ́visı ́od faktorov, ako je objem da ́t, zloz ̌itost ' dopytov a potreba spa ́jania. V prı ́pade zloz ̌ity ́ch dotazov a c ̌aste ́ho spa ́jania maju ́ MySQL a SQLite najv̈ ac ̌s ̌iu vy- jadrovaciu silu, avs ̌ak mo ̂z ̌u mat ' proble ́my s vel'mi vel'ky ́mi datasetmi. Cassandra a Mon- goDB vynikaju ́ vy ́konom a s ̌ka ́lovatel'nost 'ou, ale vyz ̌aduju ́ efektı ́vny na ́vrh sche ́matu a cielenu ́ redundanciu da ́t. ArangoDB predstavuje univerza ́lnu moz ̌nost ', ktora ́ doka ́z ̌e pra- covat ' s viacery ́mi da ́tovy ́mi modelmi, ale pre hlbs ̌ie porovnanie s Neo4j sa mo ̂z ̌e vyz ̌adovat ' d'als ̌ı ́ vy 'skum ich vy ́konu. | cs_CZ |
dc.description.abstract | The rise of Big Data has highlighted the limitations of relational databases while handling large datasets, leading to the growth of NoSQL databases. This has made DBMS benchmarking crucial for performance evaluation and decision-making. This thesis compares relational (MySQL, SQLite), graph (Neo4j, ArangoDB), docu- ment (MongoDB), and column-family (Cassandra) databases. We analyze the expressive power of their query languages and their runtime efficiency across varying data sizes. We conclude, that there's no "number one" solution for all use cases. The choice depends on factors like data volume, query complexity, and the need for joins. For complex queries and frequent joins, MySQL and SQLite are the most expressive but may struggle with very large datasets. Cassandra and MongoDB excel in perfor- mance and scalability but require efficient schema design and targeted data redundancy. ArangoDB presents a versatile option capable of handling multiple data models but might require further investigation into its performance compared to Neo4j. | en_US |
dc.language | English | cs_CZ |
dc.language.iso | en_US | |
dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
dc.subject | database management systems|performance|benchmark|static analysis|experimental analysis | en_US |
dc.subject | databázové systémy|výkon|benchmark|statická analýza|experimentální analýza | cs_CZ |
dc.title | Experimental Analysis of Query Languages in Modern Database Systems | en_US |
dc.type | bakalářská práce | cs_CZ |
dcterms.created | 2024 | |
dcterms.dateAccepted | 2024-06-28 | |
dc.description.department | Department of Software Engineering | en_US |
dc.description.department | Katedra softwarového inženýrství | cs_CZ |
dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
dc.description.faculty | Faculty of Mathematics and Physics | en_US |
dc.identifier.repId | 254987 | |
dc.title.translated | Experimentální analýza dotazovacích jazyků v moderních databázových systémech | cs_CZ |
dc.contributor.referee | Holubová, Irena | |
thesis.degree.name | Bc. | |
thesis.degree.level | bakalářské | cs_CZ |
thesis.degree.discipline | Computer Science with specialisation in Databases and Web | en_US |
thesis.degree.discipline | Informatika se specializací Databáze a web | cs_CZ |
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 softwarového inženýrství | cs_CZ |
uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Software Engineering | 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 | Informatika se specializací Databáze a web | cs_CZ |
uk.degree-discipline.en | Computer Science with specialisation in Databases and Web | 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.cs | Prı ́chod Vel'ky ́ch Da ́t pouka ́zal na obmedzenia relac ̌ny ́ch databa ́z pri spracovanı ́vel'ky ́ch datasetov, c ̌o viedlo k na ́rastu NoSQL databa ́z. Z tohto do ̂vodu sa DBMS benchmarking stal kl'u ́c ̌ovy ́m pre hodnotenie vy ́konnosti a celkovy ́ rozhodovacı ́ proces. Ta ́to pra ́ca porovna ́va relac ̌ne ́ (MySQL, SQLite), grafove ́ (Neo4j, ArangoDB), doku- mentove ́ (MongoDB) a stl ́pcovo-orientovane ́ (Cassandra) databa ́zy. Analyzujeme vyja- drovaciu silu ich dopytovacı ́ch jazykov a efektivitu poc ̌as behu pri ro ̂znych vel'kostiach da ́t. Dospeli sme k za ́veru, z ̌e neexistuje z ̌iadne ries ̌enie "c ̌ı 'slo jeden" pre vs ̌etky prı ́pady pouz ̌itia. Vy ́ber za ́visı ́od faktorov, ako je objem da ́t, zloz ̌itost ' dopytov a potreba spa ́jania. V prı ́pade zloz ̌ity ́ch dotazov a c ̌aste ́ho spa ́jania maju ́ MySQL a SQLite najv̈ ac ̌s ̌iu vy- jadrovaciu silu, avs ̌ak mo ̂z ̌u mat ' proble ́my s vel'mi vel'ky ́mi datasetmi. Cassandra a Mon- goDB vynikaju ́ vy ́konom a s ̌ka ́lovatel'nost 'ou, ale vyz ̌aduju ́ efektı ́vny na ́vrh sche ́matu a cielenu ́ redundanciu da ́t. ArangoDB predstavuje univerza ́lnu moz ̌nost ', ktora ́ doka ́z ̌e pra- covat ' s viacery ́mi da ́tovy ́mi modelmi, ale pre hlbs ̌ie porovnanie s Neo4j sa mo ̂z ̌e vyz ̌adovat ' d'als ̌ı ́ vy 'skum ich vy ́konu. | cs_CZ |
uk.abstract.en | The rise of Big Data has highlighted the limitations of relational databases while handling large datasets, leading to the growth of NoSQL databases. This has made DBMS benchmarking crucial for performance evaluation and decision-making. This thesis compares relational (MySQL, SQLite), graph (Neo4j, ArangoDB), docu- ment (MongoDB), and column-family (Cassandra) databases. We analyze the expressive power of their query languages and their runtime efficiency across varying data sizes. We conclude, that there's no "number one" solution for all use cases. The choice depends on factors like data volume, query complexity, and the need for joins. For complex queries and frequent joins, MySQL and SQLite are the most expressive but may struggle with very large datasets. Cassandra and MongoDB excel in perfor- mance and scalability but require efficient schema design and targeted data redundancy. ArangoDB presents a versatile option capable of handling multiple data models but might require further investigation into its performance compared to Neo4j. | en_US |
uk.file-availability | V | |
uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra softwarového inženýrství | cs_CZ |
thesis.grade.code | 1 | |
uk.publication-place | Praha | cs_CZ |
uk.thesis.defenceStatus | O | |