polito.it
Politecnico di Torino (logo)

Multi-Threaded Keyword Search in a Memory-Resident Graph Store

Francesco Chimienti

Multi-Threaded Keyword Search in a Memory-Resident Graph Store.

Rel. Paolo Garza. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Informatica (Computer Engineering), 2021

[img]
Preview
PDF (Tesi_di_laurea) - Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives.

Download (5MB) | Preview
Abstract:

ConnectionLens is a Java-based project developed by the Cedar research team at Inria which, given a set of heterogeneous data sources, consolidates them into a single graph. The graph is stored into a relational database (i.e. PostgreSQL). Furthermore, a keyword search query algorithm has been developed in Java, consulting ConnectionLens nodes and edges from the PostgreSQL back-end. In the present work, we seek to improve the performance of the query algorithm by: (i) migrating graphs built by ConnectionLens into a new graph store, developed in C++ and memory-resident; (ii) developing a novel query algorithm that accesses the graph from such an in-memory store and takes advantage of multi-thread parallelism.

Relators: Paolo Garza
Academic year: 2020/21
Publication type: Electronic
Number of Pages: 79
Subjects:
Corso di laurea: Corso di laurea magistrale in Ingegneria Informatica (Computer Engineering)
Classe di laurea: New organization > Master science > LM-32 - COMPUTER SYSTEMS ENGINEERING
Ente in cotutela: TELECOM ParisTech (FRANCIA)
Aziende collaboratrici: INRIA
URI: http://webthesis.biblio.polito.it/id/eprint/19294
Modify record (reserved for operators) Modify record (reserved for operators)