This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:is [2015/09/14 13:40] svsummer [An implementation of the SCULPT schema language for tabular data on the Web] |
teaching:mfe:is [2016/02/16 10:51] svsummer [Compiling SPARQL queries into machine code] |
||
|---|---|---|---|
| Line 59: | Line 59: | ||
| The objective of this master thesis is to apply the same methodology to engineer a compiler that translates (fragments of) SPARQL (the standard query language for querying RDF data on the semantic web) into machine code. The overall methodology should follow the methodology used by HyPer and Legobase: | The objective of this master thesis is to apply the same methodology to engineer a compiler that translates (fragments of) SPARQL (the standard query language for querying RDF data on the semantic web) into machine code. The overall methodology should follow the methodology used by HyPer and Legobase: | ||
| * Use of a high-level language to construct the compiler (Scala, http://scala-lang.org/) | * Use of a high-level language to construct the compiler (Scala, http://scala-lang.org/) | ||
| - | * Use of Latent Modular Staging (LMS for short) for generating low-level portable assembly code at runtime (http://scala-lms.github.io/) | + | * Use of Lightweight Modular Staging (LMS for short) for generating low-level portable assembly code at runtime (http://scala-lms.github.io/) |
| * Use of LLVM (http://llvm.org/) as a portable assembly code and corresponding translator to machine code. | * Use of LLVM (http://llvm.org/) as a portable assembly code and corresponding translator to machine code. | ||
| Line 114: | Line 114: | ||
| The objective of this master thesis is to design and engineer a runtime system and compiler for (a fragment) of AQL based on finite state automata. Ideally, to obtain the best performance, these automata should be compiled into machine-code when executed. For this compilation, the following technologies should be used: | The objective of this master thesis is to design and engineer a runtime system and compiler for (a fragment) of AQL based on finite state automata. Ideally, to obtain the best performance, these automata should be compiled into machine-code when executed. For this compilation, the following technologies should be used: | ||
| * A a high-level language to construct the compiler (Scala, http://scala-lang.org/) | * A a high-level language to construct the compiler (Scala, http://scala-lang.org/) | ||
| - | * Use of Latent Modular Staging (LMS for short) for generating low-level portable assembly from the automata at runtime (http://scala-lms.github.io/) | + | * Use of Lightweight Modular Staging (LMS for short) for generating low-level portable assembly from the automata at runtime (http://scala-lms.github.io/) |
| * Use of LLVM (http://llvm.org/) as a portable assembly code and corresponding translator to machine code. | * Use of LLVM (http://llvm.org/) as a portable assembly code and corresponding translator to machine code. | ||
| Line 146: | Line 146: | ||
| \\ | \\ | ||
| - | **Status**: available | + | **Status**: taken |
| Line 208: | Line 208: | ||
| \\ | \\ | ||
| **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | ||
| + | |||
| + | |||
| + | **Status?** Already taken | ||