arXiv subjects

Jacques Chabin

Publications and source records attributed to Jacques Chabin.

6 recordsLinked to original sources

arXiv2025

Extracting node comparison insights for the interactive exploration of property graphs

While scoring nodes in graphs to understand their importance (e.g., in terms of centrality) has been investigated for decades, comparing nodes in property graphs based on their properties has not, to our knowledge, yet been addressed. In this paper, we propose an approach to automatically extract comparison of nodes in property graphs, to support the interactive exploratory analysis of said graphs. We first present a way of devising comparison indicators using the context of nodes to be compared. Then, we formally define the problem of using these indicators to group the nodes so that the comparisons extracted are both significant and not straightforward. We propose various heuristics for solving this problem. Our tests on real property graph databases show that simple heuristics can be used to obtain insights within minutes while slower heuristics are needed to obtain insights of higher quality.

cs.DB↗

arXiv2025

Bridging Textual Data and Conceptual Models: A Model-Agnostic Structuring Approach

We introduce an automated method for structuring textual data into a model-agnostic schema, enabling alignment with any database model. It generates both a schema and its instance. Initially, textual data is represented as semantically enriched syntax trees, which are then refined through iterative tree rewriting and grammar extraction, guided by the attribute grammar meta-model \metaG. The applicability of this approach is demonstrated using clinical medical cases as a proof of concept.

cs.DB↗

arXiv2024

From Text to Databases: attribute grammar as database meta-model

We present a general methodology for structuring textual data, represented as syntax trees enriched with semantic information, guided by a meta-model G defined as an attribute grammar. The method involves an evolution process where both the instance and its grammar evolve, with instance transformations guided by rewriting rules and a similarity measure. Each new instance generates a corresponding grammar, culminating in a target grammar GT that satisfies G. This methodology is applied to build a database populated from textual data. The process generates both a database schema and its instance, independent of specific database models. We demonstrate the approach using clinical medical cases, where trees represent database instances and grammars act as database schemas. Key contributions include the proposal of a general attribute grammar G, a formalization of grammar evolution, and a proof-of-concept implementation for database structuring.

cs.DB↗

arXiv2023

Incremental Consistent Updating of Incomplete Databases

Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints from a theoretical viewpoint. The current paper considers the usability of our approach by (a) introducing incremental update routines (instead of the previous from-scratch versions) and (b) removing the restriction that limits the contents of the database to fit in the main memory. In doing so, this paper offers new algorithms, proposes queries and data models inviting discussions on the representation of incompleteness on databases. We also propose implementations under a graph database model and the traditional relational database model. Our experiments show that computation times are similar globally but point to discrepancies in some steps.

cs.DB↗

arXiv2021

Querying Linked Data: how to ensure user's quality requirements

In the distributed and dynamic framework of the Web, data quality is a big challenge. The Linked Open Data (LOD) provides an enormous amount of data, the quality of which is difficult to control. Quality is intrinsically a matter of usage, so consumers need ways to specify quality rules that make sense for their use, in order to get only data conforming to these rules. We propose a user-side query framework equipped with a checker of constraints and confidence levels on data resulting from LOD providers\' query evaluations. We detail its theoretical foundations and we provide experimental results showing that the check additional cost is reasonable and that integrating the constraints in the queries further improves it significantly.

cs.DB↗

arXiv2014

A ToolBox for Conservative XML Schema Evolution and Document Adaptation

This paper proposes a set of tools to help dealing with XML database evolution. It aims at establishing a multi-system environment where a global integrated system works in harmony with some local original ones, allowing data translation in both directions and, thus, activities on both levels. To deal with schemas, we propose an algorithm that computes a mapping capable of obtaining a global schema which is a conservative extension of original local schemas. The role of the obtained mapping is then twofold: it ensures schema evolution, via composition and inversion, and it guides the construction of a document translator, allowing automatic data adaptation w.r.t. type evolution. This paper applies, extends and put together some of our previous contributions.

cs.DB↗