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

Jerin George Mathew

dblp:305/9111 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
7since 2021 · last 2026
0000-0002-4626-826XORCID · verified

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

Software engineering, systems software and programming languages · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

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
3 papers
Information retrieval · 70% Query processing and optimization · 15% Data integration and cleaning · 15%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval-augmented generation
document chunking
1.012026
Retrieval-Augmented Generation for Service Discovery: Chunking Strategies and Benchmarking · IEEE Trans. Serv. Comput. 2026
Information retrieval
retrieval-augmented generation
1.012026
Retrieval-Augmented Generation for Service Discovery: Chunking Strategies and Benchmarking · IEEE Trans. Serv. Comput. 2026
Services computing and microservices
service discovery
1.012026
Retrieval-Augmented Generation for Service Discovery: Chunking Strategies and Benchmarking · IEEE Trans. Serv. Comput. 2026
Query processing and optimization
cardinality estimation
0.912025
Evaluating Methods for Efficient Entity Count Estimation · Proc. VLDB Endow. 2025
Data integration and cleaning
entity resolution
0.912025
Evaluating Methods for Efficient Entity Count Estimation · Proc. VLDB Endow. 2025
Information retrieval › ranking › multi-objective ranking
fair ranking
0.912025
R-Fairness: Assessing Fairness of Ranking in Subjective Data · ACL (1) 2025
Information retrieval
ranking
0.912025
R-Fairness: Assessing Fairness of Ranking in Subjective Data · ACL (1) 2025
Services computing and microservices
service composition
0.312026
Retrieval-Augmented Generation for Service Discovery: Chunking Strategies and Benchmarking · IEEE Trans. Serv. Comput. 2026
Information retrieval
evaluation
0.312025
R-Fairness: Assessing Fairness of Ranking in Subjective Data · ACL (1) 2025

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

retrieval-augmented generation · 2.0large language model · 2.0agent · 2.0subjective data analysis · 0.9statistical estimation · 0.9fairness metrics · 0.9
YearPublicationVenuePosition
2026 Retrieval-Augmented Generation for Service Discovery: Chunking Strategies and Benchmarking
abstract
Integrating multiple (sub-)systems is essential to create advanced Information Systems. Difficulties mainly arise when integrating dynamic environments, e.g., the integration at design time of not yet existing services. This has been traditionally addressed using a registry that provides the API documentation of the endpoints. Large Language Models (LLMs) have shown to be capable of automatically creating system integrations (e.g., as service composition) based on this documentation but require concise input due to input token limitations, especially regarding comprehensive API descriptions. Currently, it is unknown how best to preprocess these API descriptions. In the present work, we (i) analyze the usage of Retrieval Augmented Generation (RAG) for endpoint discovery and the chunking, i.e., preprocessing, of state-of-practice OpenAPIs to reduce the input token length while preserving the most relevant information. To further reduce the input token length for the composition prompt and improve endpoint retrieval, we propose (ii) a Discovery Agent that only receives a summary of the most relevant endpoints and retrieves specification details on demand. We evaluate RAG for endpoint discovery using (iii) a proposed novel service discovery benchmark SOCBench-D representing a general setting across numerous domains and the real-world RestBench benchmark, first, for the different chunking possibilities and parameters measuring the endpoint retrieval accuracy. Then, we assess the Discovery Agent using the same test data set. The prototype shows how to successfully employ RAG for endpoint discovery to reduce the token count. Our experiments show that endpoint-based approaches outperform naüve chunking methods for preprocessing. Relying on an agent significantly improves precision while being prone to decrease recall, disclosing the need for further reasoning capabilities.
Robin D. Pesl, Jerin George Mathew, Massimo Mecella, Marco Aiello 0001
IEEE Trans. Serv. Comput.2
2025 R-Fairness: Assessing Fairness of Ranking in Subjective Data
abstract
Lorenzo Balzotti, Donatella Firmani, Jerin George Mathew, Riccardo Torlone, Sihem Amer-Yahia. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Lorenzo Balzotti, Donatella Firmani, Jerin George Mathew, Riccardo Torlone, Sihem Amer-Yahia
ACL (1)3
2025 Advanced System Integration: Analyzing OpenAPI Chunking for Retrieval-Augmented Generation
Robin D. Pesl, Jerin George Mathew, Massimo Mecella, Marco Aiello 0001
CAiSE (2)2
2025 Data Service Composition in Cyber-Physical Systems Adopting LLMs
abstract
The increasing adoption of Large Language Models (LLMs) has significantly lowered technical barriers across various domains, enabling tasks such as code generation, database querying, and service composition. This work explores the potential of LLMs to facilitate human access to heterogeneous data in Cyber-Physical Systems (CPS). The proposed system interprets natural language queries and, by leveraging in-context learning, dynamically synthesizes data integration pipelines that compose data services, thus enabling access to information from multiple sources. The execution of a pipeline generates a table that fulfills the input query, effectively integrating and structuring the retrieved data. This paper presents the design and implementation of the proposed solution and its evaluation using a real-world case study and the BIRD benchmark dataset. The results demonstrate its effectiveness in improving data retrieval, data service design, and execution in CPS.
Adriano Izzi, Jerin George Mathew, Flavia Monti, Donatella Firmani, Francesco Leotta, Federica Mandreoli, Massimo Mecella
ICWS2
2025 Evaluating Methods for Efficient Entity Count Estimation
abstract
The problem of estimating the size of a query result has a long history in data management. When the query performs entity resolution (aka record linkage or deduplication), the problem is that of estimating the number of distinct entities, referred to as the entity count. This problem has received attention from the statistics community but it has been largely overlooked in the data management literature. In this work, we formally define the entity count problem from a data management perspective and decompose it into a framework of fundamental steps. We explore approaches from both statistics and data management, systematically identifying a design space for different pipelines that address this problem. Finally, we provide extensive experiments to highlight the strengths and weaknesses of these approaches on real-world benchmarks.
Jerin George Mathew, Donatella Firmani, Divesh Srivastava
Proc. VLDB Endow.1
2024 Composing Smart Data Services in Shop Floors Through Large Language Models
Jerin George Mathew, Flavia Monti, Donatella Firmani, Francesco Leotta, Federica Mandreoli, Massimo Mecella
ICSOC (2)1
2024 On the application of process management and process mining to Industry 4.0
abstract
Abstract The continuous evolution of digital technologies applied to the more traditional world of industrial automation led to Industry 4.0, which envisions production processes subject to continuous monitoring and able to dynamically respond to changes that can affect the production at any stage (resilient factory). The concept of agility, which is a core element of Industry 4.0, is defined as the ability to quickly react to breaks and quickly adapt to changes. Accurate approaches should be implemented aiming at managing, optimizing and improving production processes. In this vision paper, we show how process management (BPM) can benefit from the availability of raw data from the industrial internet of things to obtain agile processes by using a top-down approach based on automated synthesis and a bottom-up approach based on mining.
Flavia Monti, Jerin George Mathew, Francesco Leotta, Agnes Koschmider, Massimo Mecella
Softw. Syst. Model.2