Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jules Chevalier

dblp:129/9516 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Knowledge graphs · 46% Data stream processing · 40% Graph data management · 14%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs
knowledge graph reasoning
0.212016
Inferray: fast in-memory RDF inference · Proc. VLDB Endow. 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning › automated reasoning
incremental reasoning
0.212015
Slider: An Efficient Incremental Reasoner · SIGMOD Conference 2015
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology reasoning
0.212015
Slider: An Efficient Incremental Reasoner · SIGMOD Conference 2015
Data stream processing
stream reasoning
0.212015
Slider: An Efficient Incremental Reasoner · SIGMOD Conference 2015

Methods — techniques the papers use, named apart from their topics

incremental inference · 0.4vertical partitioning · 0.2sort-merge join · 0.2radix sort · 0.2
YearPublicationVenuePosition
2016 Incremental and Directed Rule-Based Inference on RDFS
Jules Chevalier, Julien Subercaze, Christophe Gravier, Frédérique Laforest
DEXA (2)1
2016 Inferray: fast in-memory RDF inference
abstract
The advent of semantic data on the Web requires efficient reasoning systems to infer RDF and OWL data. The linked nature and the huge volume of data entail efficiency and scalability challenges when designing productive inference systems. This paper presents Inferray, an implementation of RDFS, ρdf, and RDFS-Plus inference with improved performance over existing solutions. The main features of Inferray are 1) a storage layout based on vertical partitioning that guarantees sequential access and efficient sort-merge join inference; 2) efficient sorting of pairs of 64-bit integers using ad-hoc optimizations on MSD radix and a custom counting sort; 3) a dedicated temporary storage to perform efficient graph closure computation. Our measurements on synthetic and real-world datasets show improvements over competitors on RDFS-Plus, and up to several orders of magnitude for transitivity closure.
Julien Subercaze, Christophe Gravier, Jules Chevalier, Frédérique Laforest
Proc. VLDB Endow.3
2015 Slider: An Efficient Incremental Reasoner
abstract
The Semantic Web has gained substantial momentum over the last decade. It contributes to the manifestation of knowledge from data, and leverages implicit knowledge through reasoning algorithms. The main drawbacks of current reasoning methods over ontologies are two-fold: first they struggle to provide scalability for large datasets, and second, the batch processing reasoners who provide the best scalability so far are unable to infer knowledge from evolving data. We contribute to solving these problems by introducing Slider, an efficient incremental reasoner. Slider goes a significant step beyond existing system, including i) performance, by more than a 70% improvement in average compared to the fastest reasoner available to the best of our knowledge, and ii) inferences on streams of semantic data, by using intrinsic features that are themselves streams-oriented. Slider is fragment agnostic and conceived to handle expanding data with a growing background knowledge base. It natively supports pdf and RDFS, and its architecture allows to extend it to more complex fragments with a minimal effort. In this demo a web-based interface allows the users to visualize the internal behaviour of Slider during the inference, to better understand its design and principles.
Jules Chevalier, Julien Subercaze, Christophe Gravier, Frédérique Laforest
SIGMOD Conference1
2013 A Linked Data Reasoner in the Cloud
Jules Chevalier
ESWC1