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 12:51] svsummer [Foundations of Data Description Languages] |
||
|---|---|---|---|
| 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]] | ||