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 12:45] svsummer [Models for programming Data Management in the Cloud] |
||
|---|---|---|---|
| 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 ===== | + | ===== Structural compression of relational and semantic web databases ===== |
| - | 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. | + | 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. | ||
| - | Essentially, a simulation or bisimulation is a relation on the nodes | + | The goal of this thesis is to study scalable algorithms for |
| - | of a graph. Unfortunately, however, while efficient main-memory | + | constructing the actual succinct representations. Some in-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. | + | algorithms are already known, but given the large size of typical |
| + | database, distributed and out-of-memory alternatives need to be found. | ||
| - | The goal of this thesis is to study, compare, and implement various | ||
| - | approaches to computing simulation in an external memory setting, for | ||
| - | the explicit purpose of using the implementation to efficiently construct | ||
| - | simulation-based indexes for large relational databases and the | ||
| - | semantic web. | ||
| - | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | + | * 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 178: | ||
| \\ | \\ | ||
| * 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 ===== | ||