When does leapfrog triejoin leapfrog binary joins?
Organisatsiooni nimi
Laboratory for Software Science
Kokkuvõte
The most important operation in relational algebra is the join. Recently, there's been a surge in research on what are called "worst-case optimal joins", that is, joins that do work proportionally to the worst-case amount of data to be emitted, by joining all tables at once, instead of only two at a time, as most database systems do. Leapfrog-triejoin is one of them.
Your task is to implement leapfrog triejoin, and find out:
1. How much of an overhead does it have, in regular scenarios where binary joins suffice?
2. How dramatic, or disappointing, is the speedup for cases where it should obviously shine?
3. How does query planning change?
Your task is to implement leapfrog triejoin, and find out:
1. How much of an overhead does it have, in regular scenarios where binary joins suffice?
2. How dramatic, or disappointing, is the speedup for cases where it should obviously shine?
3. How does query planning change?
Lõputöö kaitsmise aasta
2022-2023
Juhendaja
Rucy
Suhtlemiskeel(ed)
eesti keel, inglise keel
Nõuded kandideerijale
Tase
Bakalaureus, Magister
Märksõnad
Kandideerimise kontakt
Nimi
Rucy
Tel
E-mail