Thesis (Selection of subject)Thesis (Selection of subject)(version: 285)
Assignment details
   Login via CAS
Worst Case Optimal Joins in Multi-model Data
Thesis title in Czech: Worst Case Optimal Joins in Multi-model Data
Thesis title in English: Worst Case Optimal Joins in Multi-model Data
Key words: worst case optimal join, multi-model data
English key words: worst case optimal join, multi-model data
Academic year of topic announcement: 2018/2019
Type of assignment: diploma thesis
Thesis language:
Department: Department of Software Engineering (32-KSI)
Supervisor: doc. RNDr. Irena Holubová, Ph.D.
Author:
Guidelines
Efficient join processing is one of the most fundamental tasks in database research. It has been studied extensively for single model databases, mainly relational. However, since most of the existing popular systems have become multi-model, i.e., they support several data models which can be mutually interlinked and queried, the approaches need to be extended respectively as well. The aim of the thesis is to study the approaches for single model systems and extend a selected solution to multi-model world, i.e. for a selected combination of models.
References
Yuxing Chen: Worst Case Optimal Joins on Relational and XML data. SIGMOD 2018. https://dl.acm.org/citation.cfm?id=3183721

Albert Atserias, Martin Grohe, Dániel Marx: Size bounds and query plans for relational joins. FOCS 2008. https://arxiv.org/abs/1711.03860

Radu Ciucanu, Dan Olteanu: Worst-Case Optimal Join at a Time. http://www.cs.ox.ac.uk/dan.olteanu/papers/co-tr16.pdf

Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, and Paul Valiant: Size and Treewidth Bounds for Conjunctive Queries. J. ACM 59, 3, Article 16, June 2012, 35 pages. DOI: https://doi.org/10.1145/2220357.2220363
Preliminary scope of work
Cílem práce je prozkoumat možnost rozšířit některé z řešení pro optimální realizaci operace join nad relačními daty do oblasti multi-model databází. Takové systémy nabízejí možnost pracovat s daty pomocí dvou a více logických modelů (např. grafového a dokumentového), které jsou vzájemně propojeny. Tudíž příslušné dotazy musí provádět operace join mezi různými datovými strukturami.
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html