The goal of this project is to investigate and compare methods that can be used to use a conjunctive path query (CPQ) as a key in a language-aware index for a graph database. Such a key has to be a unique representation for the entire isomorphic equivalence class of a CPQ. To achieve this goal various algorithms will be implemented and compared based on their performance. The purpose of this website is to provide an organised overview of all my notes for this project, which I can later use as a basis for a final report.
This project is being done as an internship by Roan Hofland from Eindhoven University at Osaka University Onizuka Lab and is being supervised by George Fletcher from Eindhoven University and Yuya Sasaki and Seiji Maekawa from Osaka University.