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 [2014/03/25 12:44] svsummer [Efficient computation of simulation for structural indexing] |
teaching:mfe:is [2014/03/25 13:08] svsummer [Comparision of Big Data Analysis tools] |
||
|---|---|---|---|
| Line 109: | Line 109: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | |||
| + | ===== Structural compression of relational and semantic web databases ===== | ||
| + | |||
| + | Recent research in database management systems at ULB has shown how to | ||
| + | theoretically construct succinct (compressed) representations for | ||
| + | relational databases and semantic web databases. The advantage of | ||
| + | these succinct representations is that they allow querying directly | ||
| + | *on the succinct representation*, without needing to consult the | ||
| + | underlying database. | ||
| + | |||
| + | The goal of this thesis is to study scalable algorithms for | ||
| + | constructing the actual succinct representations. Some in-memory | ||
| + | algorithms are already known, but given the large size of typical | ||
| + | database, distributed and out-of-memory alternatives need to be found. | ||
| + | |||
| + | |||
| + | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | ===== Design and Implementation of a Curriculum Revision Tool ====== | ||
| + | |||
| + | Stijn Vansummeren (WIT) | ||
| + | |||
| + | This MFE concers the analysis, design, and implementation of a | ||
| + | software system that can assist in the revision of teaching curricula | ||
| + | (also known as teaching programs). | ||
| + | |||
| + | The primary targetted functionalities of the software system are as | ||
| + | follows: | ||
| + | |||
| + | * It should allow to make different versions of the teaching programs, much in the same way as version control systems like GIT and subversion offer the possibility to make different "development branches" of a program's source code. | ||
| + | |||
| + | * It should allow an extensible means to check the modified program for inconsistentcies. (For example, if course X has course Y | ||
| ===== Structural compression of relational and semantic web databases ===== | ===== Structural compression of relational and semantic web databases ===== | ||
| Line 178: | Line 216: | ||
| \\ | \\ | ||
| * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | * Status: **already taken** | ||
| ===== Distributed Structural Indexes for RDF Data ===== | ===== Distributed Structural Indexes for RDF Data ===== | ||
| Line 207: | Line 246: | ||
| - | |||
| - | =====Foundations of Data Description Languages===== | ||
| - | |||
| - | Recently, several small "domain specific languages" have been proposed | ||
| - | to facilitate programming with ad hoc data (including PADS, | ||
| - | DATASCRIPT,PACKETTYPES, Microsoft M Grammar). Ad hoc data is data | ||
| - | other than data in well-behaved relational or XML formats. | ||
| - | |||
| - | The above languages take as input a description of the data format to | ||
| - | be dealt with, and automatically generate a large number of software | ||
| - | tools (parsers, serializers, data transformers, error recognition, | ||
| - | ...) to process the ad-hoc data. | ||
| - | |||
| - | The goal of this thesis is to study the programming language-theory | ||
| - | foundations behind these languages, their commonalities and their | ||
| - | differences. If possible, suggestions for further extensions to the | ||
| - | languages should be formulated. | ||
| - | |||
| - | * References : | ||
| - | * http://datascript.sourceforge.net/ | ||
| - | * http://www.padsproj.org/index.html | ||
| - | |||
| - | \\ | ||
| - | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||