Matteo Catena
Matteo Catena has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Renaud Delbru
Siren
3 shared publications - Stéphane Campinas
Siren – Galway, Ireland
2 shared publications - Georgeta Bordea
University of La Rochelle, L3i
1 shared publication - Ifeoluwapo Aribilola
University of Galway
1 shared publication - John G. Breslin
University of Galway
1 shared publication - Mamoona Naveed Asghar
Data Science Institute, University of Galway, H91 TK33 Galway, Ireland
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 23 (1) , 475-512
Siren Federate: Bridging document, relational, and graph models for exploratory graph analysis
Investigative workflows require interactive exploratory analysis on large heterogeneous knowledge graphs. Current databases show limitations in enabling such task. This paper discusses the architecture of Siren Federate, a system that efficiently supports exploratory graph analysis by bridging document-oriented, relational and graph models. Technical contributions include distributed join algorithms, adaptive query planning, query plan folding, semantic caching, and semi-join decomposition for path query. Semi-join decomposition addresses the exponential growth of intermediate results in path-based queries. Experiments show that Siren Federate exhibits low latency and scales well with the amount of data, the number of users, and the number of computing nodes.
- 1 January 2026
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 23 (1) , 475-512
Open AccessSiren Federate: Bridging document, relational, and graph models for exploratory graph analysis
Investigative workflows require interactive exploratory analysis on large heterogeneous knowledge graphs. Current databases show limitations in enabling such task. This paper discusses the architecture of Siren Federate, a system that efficiently supports exploratory graph analysis by bridging document-oriented, relational and graph models. Technical contributions include distributed join algorithms, adaptive query planning, query plan folding, semantic caching, and semi-join decomposition for path query. Semi-join decomposition addresses the exponential growth of intermediate results in path-based queries. Experiments show that Siren Federate exhibits low latency and scales well with the amount of data, the number of users, and the number of computing nodes.
- 10 August 2025
- Published by Springer Nature
- p. 203-218
Building Realistic Ground Truth Datasets of Personal Identification Information for Entity Matching
- 10 August 2025
- Published by Springer Nature
- p. 203-218
Building Realistic Ground Truth Datasets of Personal Identification Information for Entity Matching
- 16 March 2025
- Published by Springer Nature
- p. 186-200
Siren Federate: Bridging the Gap Between Document and Relational Data Systems for Efficient Exploratory Graph Analysis
- 16 March 2025
- Published by Springer Nature
- p. 186-200
Siren Federate: Bridging the Gap Between Document and Relational Data Systems for Efficient Exploratory Graph Analysis
- 10 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 29 (7) , 1412-1425
Energy-Efficient Query Processing in Web Search Engines
Web search engines are composed by thousands of query processing nodes, i.e., servers dedicated to process user queries. Such many servers consume a significant amount of energy, mostly accountable to their CPUs, but they are necessary to ensure low latencies, since users expect sub-second response times (e.g., 500 ms). However, users can hardly notice response times that are faster than their expectations. Hence, we propose the Predictive Energy Saving Online Scheduling Algorithm (PESOS) to select the most appropriate CPU frequency to process a query on a per-core basis. PESOS aims at process queries by their deadlines, and leverage high-level scheduling information to reduce the CPU energy consumption of a query processing node. PESOS bases its decision on query efficiency predictors, estimating the processing volume and processing time of a query. We experimentally evaluate PESOS upon the TREC ClueWeb09B collection and the MSN2006 query log. Results show that PESOS can reduce the CPU energy consumption of a query processing node up to 48% compared to a system running at maximum CPU core frequency. PESOS outperforms also the best state-of-the-art competitor with a 20% energy saving, while the competitor requires a fine parameter tuning and it may incurs in uncontrollable latency violations.
- 10 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 29 (7) , 1412-1425
Energy-Efficient Query Processing in Web Search Engines
Web search engines are composed by thousands of query processing nodes, i.e., servers dedicated to process user queries. Such many servers consume a significant amount of energy, mostly accountable to their CPUs, but they are necessary to ensure low latencies, since users expect sub-second response times (e.g., 500 ms). However, users can hardly notice response times that are faster than their expectations. Hence, we propose the Predictive Energy Saving Online Scheduling Algorithm (PESOS) to select the most appropriate CPU frequency to process a query on a per-core basis. PESOS aims at process queries by their deadlines, and leverage high-level scheduling information to reduce the CPU energy consumption of a query processing node. PESOS bases its decision on query efficiency predictors, estimating the processing volume and processing time of a query. We experimentally evaluate PESOS upon the TREC ClueWeb09B collection and the MSN2006 query log. Results show that PESOS can reduce the CPU energy consumption of a query processing node up to 48% compared to a system running at maximum CPU core frequency. PESOS outperforms also the best state-of-the-art competitor with a 20% energy saving, while the competitor requires a fine parameter tuning and it may incurs in uncontrollable latency violations.