Zenon G. Zacouris

dblp:385/4411 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0008-7806-2507ORCID · reported

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

Databases, data management, data science and information retrieval · 4 · 2 first-author · 4 since 2021
YearPublicationVenuePosition
2025 SHACL Dashboard: Analyzing Data Quality Reports Over Large-Scale Knowledge Graphs
Johannes Mäkelburg, Zenon G. Zacouris, Jin Ke 0002, Maribel Acosta
ISWC (2)2
2025 UpSHACL: Targeted Constraint Validation for Updates over Knowledge Graphs
Zenon G. Zacouris, Jin Ke 0002, Maribel Acosta
ISWC (1)1
2025 Simulating a Transactional Server for Multi-Model Systems
abstract
Multi-model systems integrate heterogeneous models, making consistency management a critical challenge. We present M2TS, a transactional server simulator for multi-model environments, enabling users to analyze the impact of consistency-preserving transactions on system performance. Unlike traditional transactional models that focus on ACID consistency, M2TS ensures multi-model consistency via bookkeepers, which propagate updates across models. The simulator supports various concurrency and consistency settings, allowing users to explore trade-offs in real-time. Through this demonstration, we provide insights into managing transactions in complex, interconnected environments.
Zenon G. Zacouris, Maribel Acosta
Proc. VLDB Endow.1
2024 Efficient Validation of SHACL Shapes with Reasoning
abstract
As the usage of knowledge graphs (KGs) becomes more pervasive in practical applications, there is a burgeoning need for high-quality data. The SHApes Constraint Language (SHACL) allows for expressing certain types of quality constraints that define sub-structures and correct values in KGs modelled with RDF. Nevertheless, performing SHACL validation without entailment often yields onesided outcomes, as it falls short of validating crucial implicit data encoded in the KG ontology. Current solutions that incorporate entailment into SHACL validation are inefficient, due to the time-intensive process of applying inference rules to the entire dataset. Moreover, applying entailment for SHACL validation can generate large amounts of redundant triples, exacerbating the validation workload and resulting in erroneous or redundant validation results. In light of these challenges, we propose Re-SHACL, an approach that combines targeted reasoning and entity merging techniques to generate a concise, consolidated RDF graph devoid of redundancy. Re-SHACL significantly reduces execution time and improves the accuracy of the validation reports. Our experiments demonstrate that Re-SHACL can be combined with state-of-the-art validators to deliver accurate validation reports efficiently.
Jin Ke 0002, Zenon G. Zacouris, Maribel Acosta
Proc. VLDB Endow.2