Nicolas Lumineau

A Survey of FRBRization Techniques

The Functional Requirements for Bibliographic Records (FRBR), an emerging model in the bibliographic domain, provide interesting possibilities in terms of cataloguing, representation and semantic enrichment of bibliographic data. However, the automated transformation of existing catalogs to fit this model is a requirement towards a wide adoption of FRBR in libraries. The cultural heritage community proposed a notable amount of FRBRization tools and projects, thus making it difficult for practitioners to compare and evaluate them. In this paper, we propose a synthetic and relevant classification of the FRBRization techniques according to specific criteria of comparison such as model expressiveness or specific enhancements.

ColisTrack: testbed for a pervasive environment management system

One of the leading challenges for pervasive computing is to ease the application development to smoothly handle the surrounding environment. We consider the case where the environment produces heterogeneous and continuous data, e. g. temperature readings, car positions... We have defined a scenario for containers transportation tracking in a medical context involving the transportation of fragile biological matter in sensor-enhanced containers. This scenario has been simulated as a testbed and offers a very nice setting to measure the agility of data-centric application development. On top of this scenario, we have built a pervasive application using a Pervasive Environment Management System called SoCQ (Service oriented Continuous Queries). SoCQ provides a data-oriented perspective of the pervasive environment, mixing classical data, streams and functionalities. For the demo, our objective is twofold: first, from the application developer point of view, she has access to the underlying SoCQ-schema and she may pose her own SQL-like queries to the simulated environment. Second, from the end-user point of view, she may quite easily interact with the environment either through a general dynamic visualization with Google Maps of hospitals, cars moving along roads and medical containers waiting or being transported, or by getting SMS notifications on her own phone of results of predefined queries.

Hierarchy-Based update propagation in decision support systems

Sales forecasting systems are used by enterprise managers and executives to better understand the market trends and prepare appropriate business plans. These decision support systems usually use a data warehouse to store data and OLAP tools to visualize query results. A specific feature of sales forecasting systems regarding future predictions modification is backward propagation of updates, which is the computation of the impact of modifications on summaries over base data. In Data warehouses, some methods propagate updates in hierarchies when data sources are subject to modifications. However, very few works have been devoted so far, regarding update propagation from summaries to data sources. This paper proposes an algorithm called PAM (Propagation of Aggregate Modification), to efficiently propagate modifications on summaries over base data. Experiments on an operational application (Anticipeo) have been conducted.

Open Datasets for Evaluating the Interpretation of Bibliographic Records

The transformation of legacy MARC catalogs to FRBR catalogs (FRBRization) is a complex and important challenge for libraries. Although many FRBRization tools have provided experimental validation, it is difficult to evaluate and compare these systems on a fair basis due to a lack of common datasets. This poster presents two public datasets (T42 and BIB-RCAT) intended to support the validation of the FRBRization process.

A Novel Vision for Navigation and Enrichment in Cultural Heritage Collections

In the cultural heritage domain, there is a huge interest in utilizing semantic web technology and build services enabling users to query, explore and access the vast body of cultural heritage information that has been created over decades by memory institutions. For successful conversion of existing data into semantic web data, however, there is often a need to enhance and enrich the legacy data to validate and align it with other resources and reveal its full potential. In this visionary paper, we describe a framework for semantic enrichment that relies on the creation of thematic knowledge bases, i.e., about a given topic. These knowledge bases aggregate information by exploiting structured resources (e.g., Linked Open Data cloud) and by extracting new relationships from streams (e.g., Twitter) and textual documents (e.g., web pages). Our focused application in this paper is how this approach can be utilized when transforming library records into semantic web data based on the FRBR model in the process that commonly is called FRBRization.

Benchmarking and evaluating the interpretation of bibliographic records

In a global context which promotes the use of explicit semantics for sharing information and developing new services, the MAchine Readable Cataloguing (MARC) format that is commonly used by libraries worldwide has demonstrated its many limitations. The conceptual reference model for bibliographic information presented in the Functional Requirements for Bibliographic Records (FRBR) is expected to be the foundation for a new generation of catalogs that will replace MARC and the digital card catalog. The need for transformation of legacy MARC records to FRBR representation (FRBRization) has led to the proposal of various tools and approaches. However, these projects and the results they achieve are difficult to compare due to lack of common datasets and well defined and appropriate metrics. Our contributions fill this gap by proposing BIB-R, the first public benchmark for the FRBRization process. It is composed of two datasets that enable the identification of the strengths and weaknesses of a FRBRization tool. It also defines a set of well defined metrics that evaluate the different steps of the FRBRization process. Those resources, as well as the results of a large experiment involving three FRBRization tools tested against our benchmark, are available to the community under an open licence.

BIB-R: A Benchmark for the Interpretation of Bibliographic Records

In a global context which promotes the use of explicit semantics for sharing information and developing new services, the MAchine Readable Cataloguing (MARC) format that is commonly used by libraries worldwide has demonstrated its limitations. The semantic model for representing cultural items presented in the Functional Requirements for Bibliographic Records (FRBR) is expected to be a successor of MARC, and the complex transformation of MARC catalogs to FRBR catalogs (FRBRization) led to the proposition of various tools and approaches. However, these projects and the results they achieve are difficult to compare on a fair basis due to a lack of common datasets and appropriate metrics. Our contributions fill this gap by proposing the first public benchmark for the FRBRization process.

Extending conceptual data model for dynamic environment

The design of data-centric pervasive applications in dynamic environments is raising more and more interests in many application domains. To design pervasive applications, we take advantage of recent advances in database management systems dealing with streams and services: new systems exist that simplify pervasive application deployment. We believe that the field is now mature and that conceptual data models like Entity-Relationship models could be revisited at the light of the pervasive application requirements. In this paper, we propose to extend an Entity-Relationship model to a new conceptual model, the so-called XD-ER equipped with some key notions: dynamic datasource types to model both streams and services and dynamic relationship types to link dynamic datasource types to classical entity types. Based on the SoCQ data model, we point out how to transform a conceptual XD-ER schema into XD-Relations straightly implementable in the SoCQ engine. The use of our model is shown through a running example.

Schedule-based P2P network organization

In this article, we propose an approach to improve peer-to-peer (P2P) backup protocol. The main idea of PIP backup systems is to use the shared storage space available on each peer in order to store data replicas of each data. These solutions become popular to ensure data availability but several limits quickly appear because of the lack of collaboration between peers. In order to resolve some existing limits related to the large scale highly dynamic context of P2P networks, we define a set of schedules for each peer and for each group of collaborating peers to model their availability and needs. Our approach based on a specific clustered organization of the network allows improving the interaction of the collaborating peers and the definition of a group satisfaction metric which allows efficiently handling and maintaining the peer groups. Indeed, the backup process based on collaborating peers ensures the efficient usage of peer resources. Performances are validated through simulations.

A Preventive Auto-Parallelization Approach for Elastic Stream Processing

Nowadays, more and more sources (connected devices, social networks, etc.) emit real-time data with fluctuating rates over time. Existing distributed stream processing engines (SPE) have to resolve a difficult problem: deliver results satisfying end-users in terms of quality and latency without over-consuming resources. This paper focuses on parallelization of operators to adapt their throughput to their input rate. We suggest an approach which prevents operator congestion in order to limit degradation of results quality. This approach relies on an automatic and dynamic adaptation of resource consumption for each continuous query. This solution takes advantage of i) a metric estimating the activity level of operators in the near future ii) the AUTOSCALE approach which evaluates the need to modify parallelism degrees at local and global scope iii) an integration into the Apache Storm solution. We show performance tests comparing our approach to the native solution of this SPE.