比利时布鲁塞尔自由大学招收数据库方向PhD学生

maxwellcy

比利时布鲁塞尔自由大学(l'Université Libre de Bruxelles)招收数据库方向PhD学生（全职或联合培养，公派渠道）。感兴趣的同学可给教授本人发邮件询问具体事宜。

l'Université Libre de Bruxelles (or ULB for short) has recently set up a collaboration with the China Scolarship Council (CSC) that provides 30 PhD scholarships annually. These scholarships are joint PhD or full PhD scholarships directly intended for Chinese students who wish to do a (joint) PhD at the ULB. If the PhD is jointly supervised, the students will be at ULB for a period between 6-24 months (the duration of the scholarship). In case of a non-joint PhD, it will be for a period up to 4 years. In this context, ULB representatives will apparently be visiting 2 open-house days in beijing on october 17 & 18 and 29 & 30 november to promote the available PhD topics.

Professor  (ULB) is a pretty good database theoretician, he wants to team up with Professor Wenfei Fan (University of Edinburgh) to co-supervise the CSC students.

See more about the professors:
Stijn Vansummeren: code.ulb.ac.be/code.people.php?id=992
Wenfei Fan: homepages.inf.ed.ac.uk/wenfei/

Following are two interesting topics for students.

[Computer Science: Design of Big Data Query Languages]

Abstract : Modern applications are faced with increasingly large volumes of data to analyze. In an effort to face this data avalanche, sophisticated applications are tapping into the power of parallel and distributed computing offered by multicore processors and cloud computing. Unfortunately, parallel and distributed programming today remains challenging, even for the best programmers. Much effort is therefore being put in the creation of new, expressive, *declarative* query and programming languages that are naturally yield paralel and distributed executions. Notable examples from industry include Yahoo's Pig Latin, Apache's Hive (both targetting Map/Reduce), and Microsoft's DryadLINQ (targetting Dryad), and GraphLab  (targetting Pregel). Recently, another route towards distributed programming has been suggested, when researchers demonstrated that Datalog, a logic-based database query language intensely studied in the 1980s, can serve as the rootstock of a simpler family of languages for programming seriously parallel and distributed software. Programs written in this style are reported to be orders of magnitude more compact than popular imperatively implemented systems. This PhD thesis deals with the study and design of query languages for the parallel and distributed analysis of large volumes of data, using datalog-style of languages as a starting point.

[Distributed Structural Indexes for RDF Data]   

Abstract : In an effort to enable people to share information in a structured form on the Web as easily as they can share unstructured HTML documents today, the World Wide Web Consortium (W3C for short) is calling for the creation of a Web of Linked Data. In the same way as one uses HTML and hyperlinks to publish and connect information on the Web of Documents, one uses the RDF data model and RDF links to publish and connect structured information on the Web of Linked Data. The advantage of RDF over HTML lies in its simplicity: all information is represented uniformly as triples of the form (subject, predicate, object). Linked Data has the potential to turn the Web into one huge database with structured querying capabilities that vastly exceed the limited keyword search queries so common on the Web of Documents today. As a key component of efficient query answering in Linked Data Management systems, much research is focused on devising high-performance native RDF indexing data structures. One class of such indexes, called structural indexes, seem very promising in this respect. Currently however, structural indexes for RDF are difficult to distribute accross the web. Given the importance of distribution in web-scale data, the goal of this thesis is to investigate how structural RDF indexes can be used in a distributed query answering platform.
ULB PhD Info calendar.pdf (401.58 KB, 下载次数: 291)

2013-10-29 21:11 上传

点击文件名下载附件