14.00, room 455, PCRI
14.00, room 455, PCRI
Permanent link to this article: https://team.inria.fr/oak/2012/06/26/alin-deutsch-policy-aware-sender-anonymity-in-location-based-services/
The first “Oak day” took place at Château de Dampierre on June 22, 2012.
Here is the schedule of the day:
9h30 Welcome coffee + pastry
10h00 Overview of the last year (Nicole + Ioana) [slides]
Restructuring, arrivals, departures
Who does what: responsibilities within the team, Paris Sud, Inria etc.
10h15 Melanie Herschel (BD/OAK): Foundations and Algorithms to Compute the Provenance of Missing Data [slides]
11h00 Philippe Rigaux (Internet Memory): Large-scale Web data management at InternetMemory [slides]
11h30 “Present me a problem”
14h30 Paolo Atzeni (U. Roma Tré, Italy): Management of Heterogeneous Data in Traditional and non Traditional Database [slides]
15h00 Visite Château de Dampierre
16h00 Coﬀee break
16h15 Konstantinos Karanasos: “How to hunt for a postdoc”
16h45 Team grants and software (Nicole + Ioana)
17h00 Choose your activity:
* Work meeting (permanent Oaks, if energy left)
* Free time
This is the most recent Oak group photo (in front of the castle):
And these are some additional photos of the day:
Permanent link to this article: https://team.inria.fr/oak/2012/06/22/oak-day-at-chateau-de-dampierre/
14.00, room 455, PCRI
As an essential part of the W3C’s semantic web stack and linked data initiative, RDF data management systems (also known as triplestores) have drawn a lot of research attention. The majority of these systems use value-based indexes (e.g., B+-trees) for physical storage, and ignore many of the structural aspects present in RDF graphs. Structural indexes, on the other hand, have been successfully applied in XML and semi-structured data management to exploit structural graph information in query processing. In those settings, a structural index groups nodes in a graph based on some equivalence criterion, for example, indistinguishability with respect to some query workload (usually XPath). Motivated by this body of work, we have started the SAINT-DB project to study and develop a native RDF management system based on structural indexes. In this talk we present a principled framework for designing and using RDF structural indexes for practical fragments of SPARQL, based on recent formal structural characterizations of these fragments. We then explain how structural indexes can be incorporated in a typical query processing work ow; and discuss the design, implementation, and initial empirical evaluation of our approach.
You can find the slides of the talk here.
Permanent link to this article: https://team.inria.fr/oak/2012/06/08/jan-hidders-a-structural-approach-to-indexing-triples/
Permanent link to this article: https://team.inria.fr/oak/2012/05/25/sigmod-2012-was-great/
“SPARQL query answering with bitmap indexes” (short paper), Julien Leblay
4th International Workshop on Semantic Web Information Management – May 20, 2012, Scottsdale, AZ, USA.
Permanent link to this article: https://team.inria.fr/oak/2012/04/20/swim2012/
Permanent link to this article: https://team.inria.fr/oak/2012/04/17/icwe-2012-vip2p-efficient-xml-management-in-dht-networks/
Permanent link to this article: https://team.inria.fr/oak/2012/04/16/acm-toit-minersoft-software-retrieval-in-grid-and-cloud-computing-infrastructures/
This is a set of notes I drafted in early 2010 for my students of that time. Current students asked that I blog them here, so here it goes:
It is a timeless truth that papers may need squeezing. Below, find a list of basic tricks, which are not subtle but very helpful, and which every successful author in the field knows.
As part of getting a PhD, you are supposed to learn these and apply them independently and appropriately.
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/ioanas-latex-squeezing-tips/
The White House is launching a “Big Data is Big Deal” (more formally, “Big Data Research and Development Initiative”), for a total of $200M. Details can be found here and here.
For instance, within, there is the information that DARPA:
“intends to invest approximately $25 million annually for four years to develop computational techniques and software tools for analyzing large volumes of data, both semi-structured (e.g., tabular, relational, categorical, meta-data) and unstructured (e.g., text documents, message traffic).“
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/usa-big-data-initiative/
Following insistent suggestions within the team, we start an Oak blog, which we will use to share & comment on interesting stories!
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/welcome-to-the-oak-blog/