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

Tendry Randriamalala

dblp:169/9825 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-6988-0216ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Data stream processing · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Data stream processing
distributed stream processing
0.312017
Strider: An Adaptive, Inference-enabled Distributed RDF Stream Processing Engine · Proc. VLDB Endow. 2017
Data stream processing
RDF stream processing
0.312017
Strider: An Adaptive, Inference-enabled Distributed RDF Stream Processing Engine · Proc. VLDB Endow. 2017
Knowledge, reasoning and agents › Knowledge representation and reasoning › temporal reasoning
stream reasoning
0.112017
Strider: An Adaptive, Inference-enabled Distributed RDF Stream Processing Engine · Proc. VLDB Endow. 2017

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

inference · 0.6fault tolerance · 0.6
YearPublicationVenuePosition
2017 Strider: An Adaptive, Inference-enabled Distributed RDF Stream Processing Engine
abstract
Real-time processing of data streams emanating from sensors is becoming a common task in industrial scenarios. An increasing number of processing jobs executed over such platforms are requiring reasoning mechanisms. The key implementation goal is thus to efficiently handle massive incoming data streams and support reasoning, data analytic services. Moreover, in an on-going industrial project on anomaly detection in large potable water networks, we are facing the effect of dynamically changing data and work characteristics in stream processing. The Strider system addresses these research and implementation challenges by considering scalability, fault-tolerance, high throughput and acceptable latency properties. We will demonstrate the benefits of Strider on an Internet of Things-based real world and industrial setting.
Xiangnan Ren, Olivier Curé, Jérémy Lhez, Badre Belabbess, Tendry Randriamalala, Yufan Zheng, Gabriel Képéklian
Proc. VLDB Endow.6
2015 LiteMat: A scalable, cost-efficient inference encoding scheme for large RDF graphs
abstract
The number of linked data sources and the size of the linked open data graph keep growing every day. As a consequence, semantic RDF services are more and more confronted with various "big data" problems. Query processing in the presence of inferences is one them. For instance, to complete the answer set of SPARQL queries, RDF database systems evaluate semantic RDFS relationships (subPropertyOf, subClassOf) through time-consuming query rewriting algorithms or space-consuming data materialization solutions. To reduce the memory footprint and ease the exchange of large datasets, these systems generally apply a dictionary approach for compressing triple data sizes by replacing resource identifiers (IRIs), blank nodes and literals with integer values. In this article, we present a structured resource identification scheme using a clever encoding of concepts and property hierarchies for efficiently evaluating the main common RDFS entailment rules while minimizing triple materialization and query rewriting. We will show how this encoding can be computed by a scalable parallel algorithm and directly be implemented over the Apache Spark framework. The efficiency of our encoding scheme is emphasized by an evaluation conducted over both synthetic and real world datasets.
Olivier Curé, Hubert Naacke, Tendry Randriamalala, Bernd Amann
IEEE BigData3