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/05/08 09:27] svsummer |
teaching:mfe:is [2015/09/14 13:41] svsummer [Engineering a runtime system and compiler for AQL] |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | |||
| + | ===== Graph Indexing for Fast Subgraph Isomorphism Testing ===== | ||
| + | |||
| + | There is an increasing amount of scientific data, mostly from the bio-medical sciences, that can be represented as collections of graphs (chemical molecules, gene interaction networks, ...). A crucial operation when searching in this data is that of subgraph isomorphism testing: given a pattern P that one is interested in (also a graph) in and a collection D of graphs (e.g., chemical molecules), find all graphs in G that have P as a subgraph. Unfortunately, the subgraph isomorphism problem is computationally intractable. In ongoing research, to enable tractable processing of this problem, we aim to reduce the number of candidate graphs in D to which a subgraph isomorphism test needs to be executed. Specifically, we index the graphs in the collection D by means of decomposing them into graphs for which subgraph isomorphism *is* tractable. An associated algorithm that filters graphs that certainly cannot match P can then formulated based on ideas from information retrieval. | ||
| + | |||
| + | In this master thesis project, the student will emperically validate on real-world datasets the extent to which graphs can be decomposed into graphs for which subgraph isomorphism is tractable, and run experiments to validate the effectiveness of the proposed method in terms of filtering power. | ||
| + | |||
| + | **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| + | |||
| + | **Status**: available | ||
| + | |||
| ===== Complex Event Processing for Security Analytics===== | ===== Complex Event Processing for Security Analytics===== | ||
| Line 36: | Line 48: | ||
| **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | **Interested?** Contact : [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| - | **Status**: available | + | **Status**: already taken. |
| Line 92: | Line 104: | ||
| **Interested?** Contact: [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | **Interested?** Contact: [[stijn.vansummeren@ulb.ac.be|Stijn Vansummeren]] | ||
| - | **Status**: available | + | **Status**: already taken |
| ===== Engineering a runtime system and compiler for AQL ===== | ===== Engineering a runtime system and compiler for AQL ===== | ||
| Line 134: | Line 146: | ||
| \\ | \\ | ||
| - | **Status**: available | + | **Status**: taken |
| Line 196: | Line 208: | ||
| \\ | \\ | ||
| **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | **Interested?** Contact : Stijn Vansummeren (stijn.vansummeren@ulb.ac.be), Frédéric Robert <frrobert@ulb.ac.be> | ||
| + | |||
| + | |||
| + | **Status?** Already taken | ||