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/02/20 15:48] svsummer [Master Thesis in Collaboration with Euranova] |
teaching:mfe:is [2014/03/25 13:08] svsummer [Comparision of Big Data Analysis tools] |
||
|---|---|---|---|
| Line 104: | Line 104: | ||
| Our laboratory performs collaborative research with Euranova R&D (http://euranova.eu/). The list of subjects proposed for this year by Euranova can be found | Our laboratory performs collaborative research with Euranova R&D (http://euranova.eu/). The list of subjects proposed for this year by Euranova can be found | ||
| - | {{:teaching:mfe:euranova_master_thesis_2014_basis.pdf|here}} | + | {{:teaching:mfe:mt2014_euranova.pdf|here}} |
| These subject include topics on distributed graph processing, processing big data using Map/Reduce, cloud computing, and social networks. | These subject include topics on distributed graph processing, processing big data using Map/Reduce, cloud computing, and social networks. | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| - | ===== Efficient computation of simulation for structural indexing ===== | ||
| - | Simulation and bisimulation are fundamental notions in computer science. They underlie many formal verification algorithms, and have recently been applied to the construction of indexing data structures for relational databases and the semantic web. | ||
| - | Essentially, a simulation or bisimulation is a relation on the nodes | + | ===== Structural compression of relational and semantic web databases ===== |
| - | of a graph. Unfortunately, however, while efficient main-memory | + | |
| - | algorithms for computing whether two nodes are simulating or bisimulating exist, these algorithms fail when no the input graphs are too large to fit in main memory. | + | |
| - | The goal of this thesis is to study, compare, and implement various | + | Recent research in database management systems at ULB has shown how to |
| - | approaches to computing simulation in an external memory setting, for | + | theoretically construct succinct (compressed) representations for |
| - | the explicit purpose of using the implementation to efficiently construct | + | relational databases and semantic web databases. The advantage of |
| - | simulation-based indexes for large relational databases and the | + | these succinct representations is that they allow querying directly |
| - | semantic web. | + | *on the succinct representation*, without needing to consult the |
| + | underlying database. | ||
| - | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | + | 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 ===== | ||
| + | |||
| + | 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]] | ||
| ===== Aspects of Text Analytics and Information Extraction ===== | ===== Aspects of Text Analytics and Information Extraction ===== | ||
| Line 177: | 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 206: | 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]] | ||