LIP6 CNRS Sorbonne Université Tremplin Carnot Interfaces
Direct Link LIP6 » أحـداث السـاعـة » مسجلون في الدكتوراه
http://www-ia.lip6.fr/~creusj

CREUS Jordi

دكـتور
وحـدة : BD
تاريـخ المـغادرة : 28/02/2013
http://www-ia.lip6.fr/~creusj
رئاسـة البـحث : Bernd AMANN
تأطـير مـشـترك : VODISLAV Dan

ROSES: A Continuous Query Processor for Large-Scale Content-Based RSS Feed Aggregation

RSS and Atom are generally less known than the HTML web format, but they are omnipresent in many modern web applications for publishing highly dynamic web contents. Nowadays, news sites publish thousands of RSS/Atom feeds, often organized into general topics like politics, economy, sports, culture, etc. Weblog and microblogging systems like Twitter use the RSS publication format, and even more general social media like Facebook produce an RSS feed for every user and trending topic. This vast number of continuous data-sources can be accessed by using general-purpose feed aggregator applications like Google Reader, desktop clients like Firefox or Thunderbird and by RSS mash-up applications like Yahoo! pipes, Netvibes or Google News. Today, RSS and Atom feeds represent a huge stream of structured text data which potential is still not fully exploited. In this thesis, we first present ROSES –Really Open Simple and Efficient Syndication–, a data model and continuous query language for RSS/Atom feeds. ROSES allows users to create new personalized feeds from existing real-world feeds through a simple, yet complete, declarative query language and algebra. The ROSES algebra has been implemented in a complete scalable prototype system capable of handling and processing ROSES feed aggregation queries. The query engine has been designed in order to scale in terms of the number of queries. In particular, it implements a new cost-based multi-query optimization approach based on query normalization and shared filter factorization. We propose two different factorization algorithms: (i) STA, an adaption of an existing approximate algorithm for finding minimal directed Steiner trees [CCC+98a], and (ii) VCA, a greedy approximation algorithm based on efficient heuristics outperforming the previous one with respect to optimization cost. Our optimization approach has been validated by extensive experimental evaluation on real world data collections.
Keywords: RSS, Atom, Data Stream Management Systems, publish/subscribe, continuous query processing, multi-query optimization, shared filter factorization, Steiner tree problem
مناقـشـة مـذكـرة : 07/12/2012 - 10h - Site Jussieu 25-26/105
أعـضاء لجنة المناقـشة :
Mme Ioana MANOLESCU, Directeur de Recherche à l'Inria, [Rapporteur]
M. Jean-Marc PETIT, Professeur des Universités à l’INSA Lyon, [Rapporteur]
Mme Anne DOUCET, Professeur des Universités à l’UPMC
Mme Béatrice FINANCE, Maître de Conférences à l’UVSQ (HDR)
M. Bernd AMANN, Professeur des Universités à l’UPMC
M. Dan VODISLAV, Professeur des Universités à l’UCP

إصدارات 2009-2012

 Mentions légales
| خـريـطـة المـوقـع