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/19 15:19] ezimanyi [Capturing Semantic Web Data from Web Pages] |
teaching:mfe:is [2014/03/25 12:51] svsummer [Foundations of Data Description Languages] |
||
|---|---|---|---|
| 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_2013_2014.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]] | ||
| + | ===== Structural compression of relational and semantic web databases ===== | ||
| - | ===== Efficient computation of simulation for structural indexing ===== | + | 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. | ||
| - | 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. | + | 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. | ||
| - | Essentially, a simulation or bisimulation is a relation on the nodes | ||
| - | 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 | + | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] |
| - | 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]] | + | |
| ===== Aspects of Text Analytics and Information Extraction ===== | ===== Aspects of Text Analytics and Information Extraction ===== | ||
| Line 178: | 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 ===== | ||
| Line 207: | Line 208: | ||
| - | |||
| - | =====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]] | ||
| Line 241: | Line 218: | ||
| by application providers, that can build attractive and useful applications, in particular, for devices like mobile phones, tablets, etc. | by application providers, that can build attractive and useful applications, in particular, for devices like mobile phones, tablets, etc. | ||
| - | The goals of this thesis are: (i) study the existing proposals for mapping spatio-temporal data into LOD; (ii) apply this mapping to a real-world case study (as was the case for the [[http://www.oscb.be/|Open Semantic Cloud for Brussels]] project; (iii) Based on the produced mapping, and using existing applications like the [[http://linkedgeodata.org/|Linked Geo Data project]], build applications that make use of LOD for example, to find out which cultural events are taking place at a given time at a given location. | + | The goals of this thesis are: (1) study the existing proposals for mapping spatio-temporal data into LOD; (2) apply this mapping to a real-world case study (as was the case for the [[http://www.oscb.be/|Open Semantic Cloud for Brussels]] project; (3) Based on the produced mapping, and using existing applications like the [[http://linkedgeodata.org/|Linked Geo Data project]], build applications that make use of LOD for example, to find out which cultural events are taking place at a given time at a given location. |