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/14 15:10] svsummer |
teaching:mfe:is [2014/02/19 09:14] ezimanyi [Extending SPARQL for Spatio-temporal Data Support] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2013-2014 : Web and Information Systems ====== | + | ====== MFE 2014-2015 : Web and Information Systems ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 109: | Line 109: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | ===== Efficient computation of simulation for structural indexing ===== | ||
| + | |||
| + | 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. | ||
| + | |||
| + | 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 | ||
| + | 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 137: | Line 153: | ||
| Interested? Contact [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | Interested? Contact [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | |||
| ===== Models for programming Data Management in the Cloud ===== | ===== Models for programming Data Management in the Cloud ===== | ||
| Line 190: | Line 207: | ||
| - | |||
| - | ===== Aspects of File and Data Synchronization ===== | ||
| - | |||
| - | With the ubiquitous use of mobile computational devices such as | ||
| - | laptops and PDAs, it has become increasingly important to be able to | ||
| - | synchronize data between these devices. To give a few examples: a new | ||
| - | appointment inserted in the calendar on a PDA must become visible on | ||
| - | the user's laptop after synchronization (and vice versa); files | ||
| - | modified on the laptop have to be synchronized with the Desktop | ||
| - | computer, and so on. But what do we do when an appointment is modified | ||
| - | on the PDA and at the same time deleted on the laptop? Dealing with | ||
| - | such conflicts is the main difficulty in designing good | ||
| - | synchronization software. | ||
| - | |||
| - | The goal of this thesis is to study, compare, and implement various | ||
| - | approaches to file and data synchronizers. This entails studying some | ||
| - | of the techniques used by distributed systems and version control | ||
| - | systems (such as CVS and Subversion), but also requires an | ||
| - | investigation of some more recent synchronization proposals like | ||
| - | Unison (http://www.cis.upenn.edu/~bcpierce/unison/index.html) and the | ||
| - | so-called "Lenses" proposed in the Harmony project | ||
| - | (http://www.seas.upenn.edu/~harmony). | ||
| - | |||
| - | * Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| - | |||
| =====Foundations of Data Description Languages===== | =====Foundations of Data Description Languages===== | ||
| Line 274: | Line 266: | ||
| - | * Contacts : | + | * Contact: [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE) |
| - | * [[ezimanyi@ulb.ac.be|Esteban Zimányi]] (CoDE) | + | |
| - | |||