Request optimization in the relational model

Computer science project to present to the French top schools entrance competitive exams.

This project aims to create a toy database software where request are optimized. This software is not focused on the storing of the data. The main inspiration comes from SQLite.

Functionalities:

• SELECT statement Features :

  • Attribute projection : Example: SELECT name, adres FROM Cinemas
  • WHERE clause. Example: SELECT adress FROM Cinemas WHERE name='Le Champo'
  • Cartesian product: Example: SELECT * FROM Cinema,Projection WHERE Cinema.name=Projection.cinema
  • JOIN clause: Example: SELECT addres, time FROM Cinema JOIN Projection WHERE title='Voyage à Tokyo' Optimizations:
  • Projections pushing
  • Merge sort of JOINs
  • Indexes

• INSERT INTO statement

• UPDATE statement

Usage:

make build
./main --repl

Sources:

• For the lexer and the parser (flex & bison):

  • https://www.oreilly.com/library/view/flex-bison/9780596805418/ch01.html
  • https://www.enib.fr/~harrouet/Data/Courses/Flex_Bison.pdf
  • http://aquamentus.com/flex_bison.html

• For the relational model:

  • https://ressources.unisciel.fr/sillages/informatique/bdd/ch00_menu/co/presentation_1.html
  • https://www.college-de-france.fr/agenda/cours/sciences-des-donnees-de-la-logique-du-premier-ordre-la-toile/modele-relationnel
  • http://webdam.inria.fr/Alice/

• For the coding part:

  • https://github.com/davideuler/SQLite-2.5.0-for-code-reading/
  • https://notes.eatonphil.com/database-basics-indexes.html
  • https://www.geeksforgeeks.org/introduction-of-b-tree-2/
  • https://www.geeksforgeeks.org/insert-operation-in-b-tree/