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 [2015/04/13 14:42] svsummer [Engineering a runtime system and compiler for AQL] |
teaching:mfe:is [2015/04/13 14:44] svsummer [An implementation of the SCULPT schema language for tabular data on the Web] |
||
---|---|---|---|
Line 67: | Line 67: | ||
* create associated tooling for SCULPT (i.e., parser and serializer generator, in the spirit of data description tools) | * create associated tooling for SCULPT (i.e., parser and serializer generator, in the spirit of data description tools) | ||
- | + | \\ | |
**Deliverables** of this master thesis project: | **Deliverables** of this master thesis project: | ||
- detailed description of the SCULPT proposal (document) | - detailed description of the SCULPT proposal (document) | ||
Line 105: | Line 104: | ||
- An experimental validation of the compiler, comparing efficiency of compiled queries against the cost-based reference compiler. | - An experimental validation of the compiler, comparing efficiency of compiled queries against the cost-based reference compiler. | ||
- | + | \\ | |
- | ---- | + | |
**References about SystemT**: | **References about SystemT**: | ||
* [[http://almaden.ibm.com/cs/projects/avatar/icde2008.pdf|An Algebraic Approach to Rule-Based Information Extraction]] | * [[http://almaden.ibm.com/cs/projects/avatar/icde2008.pdf|An Algebraic Approach to Rule-Based Information Extraction]] | ||
* [[http://www.sigmod.org/publications/sigmod-record/0812/p007.special.krishnamurthy.pdf|SystemT: A System for Declarative Information Extraction]] | * [[http://www.sigmod.org/publications/sigmod-record/0812/p007.special.krishnamurthy.pdf|SystemT: A System for Declarative Information Extraction]] | ||
+ | \\ | ||
**References about finite state automata evaluation**: | **References about finite state automata evaluation**: | ||
* Regular expression pattern matching can be simple and fast. http://swtch.com/~rsc/regexp/regexp1.html | * Regular expression pattern matching can be simple and fast. http://swtch.com/~rsc/regexp/regexp1.html | ||
Line 118: | Line 116: | ||
* [[http://www.diku.dk/kmc/documents/AiPL-CrashCourse.pdf|A Crash-Course in Regular Expression Parsing and Regular Expressions as Types.]] | * [[http://www.diku.dk/kmc/documents/AiPL-CrashCourse.pdf|A Crash-Course in Regular Expression Parsing and Regular Expressions as Types.]] | ||
+ | \\ | ||
**Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
+ | \\ | ||
**Status**: available | **Status**: available | ||