Title

layout: true
<slide-template title="Quantum and Intelligent Computing (QIC)" subtitle="Bachelor-/Master-Forum 2024, 29.10.2024"></slide-template>

---

class: title-slide, center, middle

<title-slide titletype="Bachelor-/Master-Forum 2024" title="Quantum and Intelligent Computing (QIC)" modulenumber="Institute of Information Systems (IFIS)" subtitle="29.10.2024"></title-slide>

---
# .darkblue[Quantum and Intelligent Computing (.bold[QIC])]
.more-more-condensed.no-margin[
- .darkblue[Head:] Prof. Dr. rer. nat. habil. <span class="darkblue">Sven Groppe</span>
- .darkblue[Projects and Research Assistants]
  - .darkblue.bold[QC4DB]: Accelerating Relational Database Management Systems via Quantum Computing (BMBF)
       - <span class="lila">Umut Çalikyilmaz</span>
       - <span class="lila">Tobias Winker</span>
       - <span class="lila">Nitin Nayak</span>
  - .darkblue.bold[QualityOnt]: High Quality Knowledge Graphs from recent English, French and German Emergent Trends with the example of COVID-19 (DFG/ANR)
       - <span class="lila">Hanieh Khorashadizadeh</span>
  - .darkblue.bold[Semantic Data] Integration and Analysis (Bosch)
       - <span class="lila">Simon Paasche</span> (External PhD Student)
  - .darkblue.bold[Hybrid$^2$]-Index Structures for Main Memory Databasess (DFG)
       - <span class="lila">Tobias Groth</span>
]

---
# .darkblue[Supervision of Bachelor/Master Thesis & Result]

.more-more-condensed[
- Often <span class="darkblue">co-supervision</span> of Prof. Groppe together with PhD student
  - <span class="darkblue">meetings regularly and on request</span>, typical:
         - <span class="darkblue">weekly</span> meetings <span class="darkblue">with PhD student</span>
         - <span class="darkblue">monthly</span> meetings <span class="darkblue">with Prof. Groppe</span>
- Experience
  - .darkblue[99 supervised thesis] (bachelor/master/student research project/Diploma/PhD)
- .darkblue[Publications] based on bachelor/master thesis
  - .darkblue[improves visibility] of student's contribution
  - .darkblue[improves chances for] good .darkblue[job] (in academia and industry)
  - .darkblue[47 (out of 186) publications (of QIC lab) are co-authored by] a bachelor/master .darkblue[student] (being a student at time of writing)
         - <span class="darkblue">25% of</span> the <span class="darkblue">publications</span>
]

---
# Typical .darkblue[Outline of Bachelor/Master Thesis]

.more-more-condensed[
<ol class="nested"><li><span class="darkblue">Introduction</span>/Einführung
  <ol class="nested"><li><span class="darkblue">Motivation</span></li>
      <li><span class="darkblue">Tasks of the Thesis</span>/Aufgabenstellung</li>
      <li><span class="darkblue">Organization</span>/Organisation der Arbeit</li></ol></li>
<li><span class="darkblue">Basics</span>/Grundlagen
   <ol class="nested"><li>...</li>
       <li><span class="darkblue">Further Related Work</span>/Weitere wissenschaftliche Literatur</li></ol></li>
<li><span class="darkblue">Concept</span>/Konzept</li>
<li><span class="darkblue">Realization</span>/Realisierung</li>
<li><span class="darkblue">Evaluation</span></li>
<li><span class="darkblue">Summary and Conclusions</span>/Zusammenfassung und Ausblick</li>
</ol>

- Latex Template available, e.g.: <a href="https://moodle.uni-luebeck.de/course/view.php?id=4439" target="_blank">In Moodle</a>
- FAQs on Bachelor’s and Master’s Theses (from examination board for MINT): in <a href="https://www.uni-luebeck.de/en/university-education/student-service-centre/examination-boards/examination-board-for-mint/questions-and-answers-on-bachelors-and-masters-theses.html" target="_blank">English</a>/<a href="https://www.uni-luebeck.de/studium/studierenden-service-center/pruefungsaemter/pruefungsamt-mint-gesundheitswissenschaften/fragen-und-antworten-zu-bachelor-und-masterarbeiten.html" target="_blank">German</a>
]

---
# .darkblue[DVD] in addition to Thesis & for IFIS Archive

.more-more-condensed.no-margin[
Please do .darkblue[not forget to burn DVDs] for each of the thesis, content:
- .darkblue[Readme-file] with installation instructions
- .darkblue[source code] with documentation
  - .darkblue[additionally] push to thesis repository in .darkblue[IFIS-Gitlab]
- all necessary .darkblue[third-party-libraries]
- all .darkblue[data sets for reproducing evaluation] in thesis
- .darkblue[PDF of the thesis]
- .darkblue[source files of the thesis] (Word-file/latex-folder)

<br/>On the day of defense please deliver .darkblue[DVD for the IFIS-archive]:
- .darkblue[Content as above]
- .darkblue[PDF of] the .darkblue[presentation] for the defense
- .darkblue[source files of the presentation] for the defense (Powerpoint file/latex-folder etc.)
]

---
# Typical .darkblue[Defense] of Thesis

.more-more-condensed[
- .darkblue[20-25 minutes presentation]
  - often similar structure like thesis, but without 4. Realization
- .darkblue[maybe with] succeeding short .darkblue[demo]nstration ($\approx$ 5 minutes) of developed software (dependent on thesis)
- Afterwards .darkblue[questions of reviewers and listeners]
- Reviewers discuss alone in room about result
- .darkblue[Reviewers announce score] to student and explain the reasons for the score
- In total: up to .darkblue[1 hour]
]

---
# .darkblue[Large Language Model (LLM) Applications]

<table class="padding-top" style="border-collapse:collapse">
<tbody><tr>
<td style="width:70%;vertical-align:top;">
<div class="more-more-condensed no-margin"><ul>
<li>New kind of application in form of a network of (LLM, human, code) agents
<ul>
<li><span class="darkblue">Applying LLMs as new paradigm for software development</span> of applications close to natural language/human users</li>
<li>Development of <span class="darkblue">new LLM applications</span> like
<ul><li>modern chatbots</li><li>extraction from natural languages text (e.g., for knowledge graph construction)</li><li>new types of applications with reasoning capabilities (self-reflection etc. for human-like generation of content)</li></ul></li>
</ul>
</li>
</ul>
</div>
</td>
<td style="width:30%;vertical-align:top;">
<img src="../../img/keynotes/ConversableAgents.svg" class="fullwidth">
</td>
</tr>
<tr>
<td colspan="2">
<div class="more-more-condensed no-margin"><ul><ul><li><span class="darkblue">Framework for platform-independent LLM application</span><ul><li>Utilizing modern programming languages like Kotlin to run code across JVM, binary targets and browsers</li></ul>
</li>
</ul></ul>
</div>
</td>
</tr>
</tbody></table>

---
# .darkblue[Construct Knowledge Graph (KG)/LLMs]

.reference[Ezzabady et al., Towards Generating High-Quality Knowledge Graphs by Leveraging Large Language Models, NLDB 2024]

.more-more-condensed.no-margin[
<div class="textcenter"><img src="../../img/keynotes/bv/KGConstructionWithLLMs.svg" style="width:85%"/></div>
<ul><li>.darkblue[Result] (comparison to manual labeling)<div class="margin-bottom"><table class="result small-font tablesmallpadding">
<thead>
<tr class="header">
<th style="text-align: center;"></th>
<th style="text-align: center;"><span class="smallcaps">Cov</span></th>
<th style="text-align: center;"><span class="smallcaps">Gen</span></th>
<th style="text-align: center;"><span class="smallcaps">Db</span></th>
</tr>
</thead>
<tbody>
<tr class="odd">
<td style="text-align: center;"><strong>Macro F1-score</strong></td>
<td style="text-align: center;">66.60</td>
<td style="text-align: center;"><strong>76.93</strong></td>
<td style="text-align: center;">72.85</td>
</tr>
</tbody>
</table></div>
<ul><li><span class="darkblue">COV:</span> Represents the original triples extracted <span class="darkblue">using GPT-4</span></li>
<li><span class="darkblue">GEN:</span> COV with <span class="darkblue">augmented data generated by GPT-4</span></li>
<li><span class="darkblue">DB:</span> Merges the original triples from <span class="darkblue">COV with triples from an external data source</span> (random set of 308 tuples from a publicly available structured database about the daily statistical updates and policy actions)</li></ul>
</li></ul>
]

---
# .darkblue[Interplay of Large Language Models (LLM) and Knowledge Graphs (KG)]

.reference[Khorashadizadeh et al., Research Trends for the Interplay between Large Language Models and Knowledge Graphs, LLM+KG@VLDB'24, <a href="https://doi.org/10.48550/arxiv.2406.08223" target="_blank">ArXiv version</a>]

---
# Architectures of .darkblue[Emergent Hardware]
.reference[Extended from <a target="_blank" href="http://www.imprs-dynamics.mpg.de/pdfs/Plessl_talk.pdf">C. Plessl, Accelerating Scientific Computing with Massively Parallel Computer Architectures, IMPRS Winter School, Wroclaw, 2012</a>]

---
# .darkblue[Timeline of Quantum Computers]
.reference[<a href="https://en.wikipedia.org/wiki/List_of_quantum_processors" target="_blank">Main Data Source</a> Roadmaps: <a href="https://research.ibm.com/blog/ibm-quantum-roadmap" target="_blank">IBM</a> <a href="https://www.computerwoche.de/a/2025-kommt-der-erste-4-000-qubit-quantencomputer" target="_blank">IBM'25</a> <a href="https://quantumai.google/research" target="_blank">Google</a> <a href="https://doi.org/10.1007/s42354-021-0342-8" target="_blank">Quantum Brilliance</a> <a href="https://www.dwavesys.com/media/xvjpraig/clarity-roadmap_digital_v2.pdf" target="_blank">D-Wave</a> <a href="https://education.jlab.org/qa/mathatom_05.html" target="_blank">#Atoms on Earth</a> <a href="https://www.popularmechanics.com/space/a27259/how-many-particles-are-in-the-entire-universe/" target="_blank">#Particles in Universe</a>]

---
# Using .darkblue[Hardware Accelerator] for optimizing Queries / Transaction Schedules
.reference[<a href="https://doi.org/10.1145/3410566.3410593" target="_blank">[BG20a]</a> <a href="http://nbn-resolving.de/urn:nbn:de:101:1-2020112218332015343957" target="_blank">[BG20b]</a>  <a href="https://doi.org/10.1145/3472163.3472164" target="_blank">[GG21]</a>]

---
# .darkblue[Approaches for Query/Transaction Schedule Optimization]

---
# .darkblue[Algorithms] .small-font30[(used e.g. in Query Optimization)] .darkblue[and their Quantum Counterparts]

.more-more-condensed.small-font[
<table class="result tablesmallpadding margin-bottom">
<tbody>
<tr>
<th>Query Optimization Approach</th>
<th>Basic Algorithm</th>
<th>Quantum Computing Counterpart</th>
</tr>
<tr>
<td><a href="https://doi.org/10.1145/582095.582099" target="_blank">[S+79]</a></td>
<td>Dynamic Programming <a href="https://doi.org/10.1038/nbt0704-909" target="_blank">[E04]</a></td>
<td><a href="https://arxiv.org/pdf/1906.02229.pdf" target="_blank">[R19]</a> <a href="https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.107" target="_blank">[A+19]</a></td>
</tr>
<tr>
<td><a href="https://doi.org/10.1145/38713.38722" target="_blank">[IW87]</a>, QA: <a href="https://doi.org/10.14778/2947618.2947621" target="_blank">[TK16]</a></td>
<td>Simulated Annealing <a href="https://doi.org/10.1126%2Fscience.220.4598.671" target="_blank">[KGV83]</a></td>
<td><a href="https://doi.org/10.1038/nature10012" target="_blank">[J+11]</a></td>
</tr>
<tr>
<td><a href="https://doi.org/10.1145/3211954.3211957" target="_blank">[MP18]</a> <a href="https://doi.org/10.1109/ICDE48307.2020.00116" target="_blank">[Y+20]</a> <a href="https://doi.org/10.1145/3329859.3329875" target="_blank">[W+19]</a> <a href="http://arxiv.org/abs/1905.06425" target="_blank">[O+19]</a></td>
<td>Reinforcement Learning <a href="https://doi.org/10.1007/BF00453370" target="_blank">[BSB81]</a></td>
<td><a href="https://doi.org/10.1038/s41586-021-03242-7" target="_blank">[S+21]</a> <a href="https://doi.org/10.1007/11539117_97" target="_blank">[DCC05]</a></td>
</tr>
<tr>
<td><a href="http://www.vldb.org/conf/1994/P085.PDF" target="_blank">[GPK94]</a></td>
<td>Random Walk <a href="https://books.google.com/books?hl=de&lr=&id=WnSoBtMiU2oC&oi=fnd&pg=PA1&dq=M.N.+Barber,+B.W.+Ninham,+Random+and+Restricted+Walks:+Theory+and+Applications,++Gordon+and+Breach,+New+York,+1970&ots=AxF58L4AL1&sig=PArEXcaS26QhyTZiYKPc5ekxEsA" target="_blank">[BN70]</a></td>
<td><a href="https://doi.org/10.1103/PhysRevA.48.1687" target="_blank">[ADZ93]</a> <a href="https://doi.org/10.1145/380752.380757" target="_blank">[A+01]</a></td>
</tr>
<tr>
<td><a href="https://minds.wisconsin.edu/bitstream/handle/1793/59438/TR1004.pdf?sequence=1" target="_blank">[BFI91]</a></td>
<td>Genetic Algorithm <a href="http://dx.doi.org/10.1038/scientificamerican0792-66" target="_blank">[H92]</a></td>
<td><a href="https://doi.org/10.1155/2013/730749" target="_blank">[W+13]</a></td>
</tr>
<tr>
<td><a href="https://doi.org/10.1007/978-981-13-2285-3_45" target="_blank">[TC19]</a></td>
<td>Ant Colony Optimization <a href="https://www-public.imtbs-tsp.eu/~gibson/Teaching/Teaching-ReadingMaterial/ColorniDorigoManiezzo91.pdf" target="_blank">[CDM91]</a> <a href="https://doi.org/10.1109/MCI.2006.329691" target="_blank">[DBS06]</a></td>
<td><a href="https://doi.org/10.1007/978-3-540-74769-7_31" target="_blank">[WNF07]</a> <a href="https://arxiv.org/abs/2010.07413" target="_blank">[G+20]</a></td>
</tr>
<tr>
<td><a href="https://doi.org/10.1145/3035918.3064039" target="_blank">[TK17]</a></td>
<td>Mixed Integer Linear <a href="https://doi.org/10.1007/BF01584074" target="_blank">[BGG+71]</a> Programming <a href="https://doi.org/10.1287/opre.50.1.42.17798" target="_blank">[D02]</a></td>
<td><a href="https://doi.org/10.1103/physrevlett.103.150502" target="_blank">[HHL09]</a> <a href="https://doi.org/10.4230/LIPICS.STACS.2012.636" target="_blank">[A12]</a> <a href="https://doi.org/10.1137/16m1087072" target="_blank">[CKS17]</a> <a href="https://doi.org/10.1103/physrevlett.122.060504" target="_blank">[SSO19]</a> <a href="https://doi.org/10.1145/3498331" target="_blank">[AL22]</a> <a href="https://doi.org/10.1145/3498331" target="_blank">[AL22]</a></td></tr>
</tbody>
</table>
.legend.darkgray.no-margin[This list is not complete...]

.no-margin[
- Please check my lecture about quantum computing:<br/><a href="https://www.ifis.uni-luebeck.de/~groppe/lectures/qc" target="_blank">https://www.ifis.uni-luebeck.de/~groppe/lectures/qc</a>]
]

---
# .darkblue[Quantum ML] for .darkblue[Query Optimization]<br/>.small-font26[(Project with Quantum Brilliance)]

.reference[<a href="https://doi.org/10.1145/3579142.3594299" target="_blank">Winker,Çalıkyılmaz,Gruenwald,Groppe, Quantum Machine Learning for Join Order Optimization using V. Q. C., BiDEDE@SIGMOD'23</a>]

<div class="more-more-condensed">
<ul><li>Compared to ML: <a href="https://doi.org/10.1038/s41467-022-32550-3" target="_blank">Learning with fewer data, higher accuracy</a></li></ul>
<div class="textcenter">
<img src="../../img/qc/ml/QuantumModel.svg" align="top" style="width:91%"></img>
</div>

<table class="fullwidth textcenter">
<tbody>
<tr>
<td>.bold[Input:] .darkblue[Relations]</td><td>Trained Model</td><td>.bold[Output:] .darkblue[Join Order]</td>
</tr>
<tr>
<td></td><td></td><td></td>
</tr>
</tbody>
</table>
<div class="textcenter">
<img src="../../img/keynotes/bv/JOOQMLInOut.svg" align="top" class="fullwidth"></img>
</div>
</div>

---
# .darkblue[Quantum ML] for .darkblue[Query Optimization]<br/>.small-font26[(Project with Quantum Brilliance)]

.reference[ErgastF1 benchmark joining 4 relations, <a href="https://doi.org/10.1145/3579142.3594299" target="_blank">Winker,Çalıkyılmaz,Gruenwald,Groppe, QML for Join Order Opt. using VQCs, BiDEDE@SIGMOD'23</a>]

---
# .darkblue[Quantum Annealing] for .darkblue[Query Optimization]<br/>.small-font26[(Project with Quantum Brilliance)]

.reference[<a href="https://doi.org/10.1145/3579142.3594298" target="_blank">Nayak,Rehfeld,Winker,Warnke,Çalıkyılmaz,Groppe, Constructing Optimal Bushy Join Trees by Solving QUBO Problems..., BiDEDE@SIGMOD'23</a>]

---
# .darkblue[Quantum Annealing] for .darkblue[Query Optimization]<br/>.small-font26[(Project with Quantum Brilliance)]

.more-more-condensed.no-margin[
- .darkblue[Real-world queries] of the ErgastF1 Benchmark with PostgreSQL
]
<div class="textcenter">
<img src="../../img/keynotes/bv/QAResults.svg" align="top" style="width:78%"></img>
</div>
.more-more-condensed.no-margin[
- QPU access time approx. 100ms
]

---
# .em[Optimizing] .darkblue[Transaction Schedules] via .darkblue[Quantum Annealing]

.reference[<a href="https://doi.org/10.1145/3410566.3410593" target="_blank">T. Bittner, S. Groppe, Avoiding Blocking by Scheduling Transactions using Quantum Annealing, IDEAS 2020</a>]

.more-more-condensed[
<table>
<tr>
<td style="width:65%;vertical-align:top">
.more-more-condensed[
- Experiments on real .darkblue[Quantum Annealer] (D-Wave 2000Q cloud service)
  - first minute free<br/>(afterwards too much for our budget)
- Versus .darkblue[Simulated Annealing on CPU]
- .darkblue[Preprocessing time/Number of QuBits]: $O((n\cdot k\cdot R)^2)$
]
</td><td style="width:35%;vertical-align:top">
<div class="textcenter"><img src="../../img/keynotes/ExperimentsQuantumAnnealing.svg" align="top" width="100%" class="padding-bottom"></img></div>
</td></tr>
</table>
<div class="textcenter"><img src="../../img/keynotes/ExperimentsQuantumAnnealingTable.svg" align="top" width="100%" class="padding-bottom"></img></div>  
]

---
# .darkblue[Open Challenges] for QC for Databases/<br/>Topics for Thesis

.logo-top-right[<img src="../../img/SvenGroppe.jpg" align="top" width="85px"></img>]

<div class="more-more-condensed">
<ul class="no-margin"><li>Replacing basic algorithms with their .darkblue[QC counterparts in query optimizations for speeding up databases]
<ul class="no-margin"><li>Query Optimization (QO): .lila[Tobias Winker]</li><li>Transaction Schedule (TS) Optimization: .lila[Umut Çalikyilmaz]</li><li>Quantum Annealing (QO/TS): .lila[Nitin Nayak]</li></ul>
</li>
<li>.darkblue[What should be the properties of a quantum computer] (e.g. #qubits, latencies of gates) to achieve certain speedups.darkblue[?]</li>
<li>.darkblue[How to combine classical and quantum computing algorithms to achieve good speedups with few qubits?]<br/>.darkgray[(...for running database optimizations on current available quantum computers...)]</li>
<li>.darkblue[What other (database) domains] besides query and transaction schedule optimizations benefit from quantum computers.darkblue[?]</li>
</ul>

---
<h1 style="line-height:32px">.darkblue[QC4DB: .small-font36[Accelerating Relational Database Management Systems via Quantum Computing]]</h1>

.more-more-condensed[
<table class="result tablesmallpadding small-font">
<tbody>
<tr>
<th>Name:</th>
<td colspan="2">.darkblue[QC4DB]: Accelerating Relational Database Management Systems via Quantum Computing</td>
</tr>
<tr>
<th>Proj. Web:</th>
<td colspan="2"><a href="https://www.quantentechnologien.de/forschung/foerderung/anwendungsnetzwerk-fuer-das-quantencomputing/qc4db.html" target="_blank">Project Website@Quantentechnologien</a></td>
</tr>
<tr>
<th>Funded by:</th>
<td colspan="2">BMBF, Fördermaßnahme .darkblue[Anwendungsnetzwerk] für das Quantencomputing</td>
</tr>
<tr>
<th>Duration:</th>
<td colspan="2">3 years</td>
</tr>
<tr>
<th>Volume:</th>
<td colspan="2">1.8M Euros</td>
</tr>
<tr>
<th>Topics:</th>
<td colspan="2">.darkblue[Optimizing] an open source relational .darkblue[database] management system <ul class="no-margin"><li>.darkblue[Queries]</li><li>.darkblue[Transaction Schedules]</li></ul></td>
</tr>
<tr>
<th>Partners:</th>
<td style="width:48%"><img src="../../img/keynotes/qc/UzL.jpg" align="bottom" width="300px"></img> (Coord.)</td>
<td><img src="../../img/keynotes/qc/QB.jpg" align="top" width="200px"></img></td>
</tr>
<tr>
<th>Expertises:</th>
<td>Hardware-Acceleration of Databases</td>
<td>Room Temperature Diamond Quantum Accelerators/qbOS</td>
</tr>
<tr>
<th>Website:</th>
<td><a href="https://www.ifis.uni-luebeck.de/~groppe/" target="_blank">https://www.ifis.uni-luebeck.de/~groppe/</a></td>
<td><a href="https://quantumbrilliance.com/" target="_blank">https://quantumbrilliance.com/</a></td>
</tr>
</tbody>
</table>
]

---
# Quantum Computing for .darkblue[Chip Design]

.more-more-condensed[
- .darkblue[FPGA routing]
  - Eliminating cross-talks of connections between components in an FPGA design and find an optimal "wiring" (see e.g. [NSR02])
- .darkblue[Logic Synthesis]
  - Minimizing Boolean Formulas
     - Classical Software: <a href="https://web.archive.org/web/20131022021257/http://www.sontrak.com/" target="_blank">Logic Friday</a> and <a href="https://github.com/genieacs/espresso-iisojs" target="_blank">Espresso-IISOJS</a>

.smaller-font[.bold[References:]<br/>[NSR02] G. Nam, K. Sakallah and R. Rutenbar, A New FPGA Detailed Routing Approach Via Search-Based Boolean Satisfiability, IEEE Transactions on computer-aided design of integrated circuits and systems, vol. 21, no. 6, 2002. <a href="https://www.researchgate.net/publication/3224844_A_new_FPGA_detailed_routing_approach_via_search-based_Boolean_satisfiability" target="_blank">PDF@RG</a>]
]

---
# .darkblue[Quantum Compting for...]

.more-more-condensed[
- .darkblue[astrophyiscs].darkgray[, e.g.,]
  - .darkgray[estimating the weight of black holes]
  - .darkgray[galaxy clustering]
- .darkblue[image processing].darkgray[, e.g.,]
  - .darkgray[classification of images]
- .darkblue[graph neural networks].darkgray[, e.g.,]
  - .darkgray[software vulnerability detection]
  - .darkgray[graph pattern matching)]
- many more use cases
]

---
# .darkblue[COVID-19 Knowledge Graph (KG)]

.more-more-condensed.small-font[
<div class="center">
<img src="../../img/keynotes/covid-19/COVID-19KnowledgeGraphExample.svg" align="top" width="90%"></img>
</div>
]

---
# <div style="line-height:0.8">.darkblue.small-font28.bold[High Quality KGs from recent English, French & German<br/>Emergent Trends with the example of COVID-19]</div>

.logo-top-right[<img src="../../img/SvenGroppe.jpg" align="top" width="85px"></img>]

.more-more-condensed.small-font[
- Project with partners in Paris & Toulouse (.lila[Hanieh Khorashadizadeh])
- Thesis in the areas of 
  - .darkblue[data capturing], 
  - .darkblue[visualization & analysis], 
  - .darkblue[detection of contradictions in KG], ...
<div class="center">
<img src="../../img/keynotes/covid-19/QualityOnt.svg" align="top" width="80%"></img>
</div>
]

---
# .darkblue[Hybrid Multi-Model Multi-Platform (HM3P) Database]

.reference[S. Groppe, J. Groppe, Hybrid Multi-Model Multi-Platform (HM3P) Databases, DATA 2020.]

.more-condensed[
<img src="../../img/keynotes/HM3PDatabase.svg" align="top" width="100%"></img>
<span class="darkgreenbackground filledCircle">+</span> full and uniform .darkgreen[data integration] at database level<br/>
<span class="darkgreenbackground filledCircle">+</span> .darkgreen[performance]: fully optimized across different data models<br/>
<span class="darkgreenbackground filledCircle">+</span> transparent .darkgreen[fault-tolerance]<br/>
<span class="darkgreenbackground filledCircle">+</span> SQL .darkgreen[standards]: .small-font22[relational ('87), XML ('03), temporal ('11), JSON ('16), Multi-dimensional Arrays ('19), schemaless ('19), streams ('20?), property graphs ('21?)]<br/>
<span class="darkgreenbackground filledCircle">+</span> <span class="bold">.darkgreen[features of different] types of .darkgreen[databases running on different platforms] can be used
</span>]

---
# Variant: .darkblue[Semantic] HM3P (.darkblue[S]HM3P) DB

.reference[S. Groppe, Semantic Hybrid Multi-Model Multi-Platform (SHM3P) Databases, ISIC 2021.]

.more-condensed.no-padding.no-margin[
<img src="../../img/keynotes/SHM3P.svg" align="top" width="100%"></img>
<ul>
<li><span class="darkblue">Semantic Layer as glue</span> between other models and platforms</li>
<li><span class="darkblue">new challenges</span> like integrating different types of reasoners in a transparent global reasoner</li>
</ul>
<span class="darkgreenbackground filledCircle">+</span> .darkgreen[Features of HM3P] databases<br/>
<span class="darkgreenbackground filledCircle">+</span> Easier .darkgreen[data integration]<br/>
<span class="darkredbackground filledCircle">-</span> .darkblue[Performance issues] may occur due to semantic layer
]

---
# .darkblue[Types of DBMS]

.more-condensed.no-padding.no-margin[
<img src="../../img/keynotes/(S)(H)(MM)(MP).svg" align="top" width="100%"></img>
]

---
# .darkblue[The Power of Multi-Platform: LUPOSDATE3000]

.more-more-condensed[
<table>
<tbody>
<tr>
<td class="halfwidth" style="vertical-align:top">
.more-more-condensed[
- .darkblue[ultra-fast in jvm]...
  <div class="textcenter" style="line-height:0.6;"><img src="../../img/keynotes/LUPOSDATE3000Experiments.svg" align="top" class="fullwidth"></img><br/>.smaller-font[<a href="https://doi.org/10.18420/btw2021-12" target="_blank">B. Warnke, M.W. Rehan, S. Fischer, S. Groppe: Flexible data partitioning schemes for parallel merge joins in semantic web queries in: BTW'21</a>]</div>
]
</td>
<td class="halfwidth" style="vertical-align:top">
.more-more-condensed[
- ...but also .darkblue[enabling web demos running completely in] the .darkblue[browser!]
    <div class="textcenter" style="line-height:0.6;"><video controls="controls" preload="preload" class="fullwidth">
  <source src="https://www.ifis.uni-luebeck.de/~groppe/soundofdatabases/resources/CommonSubexpressions.mp4">
  Your browser does not support the video element!
</video><br/><span class="smaller-font"><a href="http://www.vldb.org/pvldb/vol14/p2695-groppe.pdf" target="_blank">S. Groppe, R. Klinckenberg, B. Warnke. Sound of Databases: Sonification of a Semantic Web Database Engine. PVLDB, 14(12), 2021</a></span></div>
]
</td>
</tr>
</tbody>
</table>
]