This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:mfe:is [2014/03/25 13:08] svsummer [Comparision of Big Data Analysis tools] |
teaching:mfe:is [2014/03/25 13:08] svsummer [Structural compression of relational and semantic web databases] |
||
|---|---|---|---|
| Line 111: | Line 111: | ||
| - | ===== 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]] | ||