Matthew Damigos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matthew Damigos has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Manolis Gergatsoulis
12 shared publicationsEleftherios Kalogeros
7 shared publications- Eleftherios Kalogeros
Ionian University
6 shared publications - Manolis Gergatsoulis
Ionian University
4 shared publications Christos Nomikos
3 shared publicationsFoto Afrati
3 shared publications
Latest Publications
- 29 September 2026
- Published by Springer Nature
- p. 189-198
Description Generation of JSON Data for Fuzzy Joins Processing
- 29 September 2026
- Published by Springer Nature
- p. 189-198
Description Generation of JSON Data for Fuzzy Joins Processing
- 17 April 2026
- Published by Elsevier in Information Systems
- Vol. 140
Evaluating continuous Basic Graph Patterns over Dynamic Link Data Graphs
- 17 April 2026
- Published by Elsevier in Information Systems
- Vol. 140
Evaluating continuous Basic Graph Patterns over Dynamic Link Data Graphs
- Open Access
Computation of fuzzy joins over large collections of JSON data using semantic similarity
In recent years, fuzzy joins have emerged as a critical tool in data integration, data cleaning, and similarity-based retrieval tasks, especially when dealing with noisy or heterogeneous data. Although fuzzy joins have been widely explored for relational data, existing approaches typically focus on textual similarity, matching records based on certain text values and text distances. Apart from relational data, syntactic similarity of XML and JSON documents has also been investigated, where the matching documents are compared over their hierarchical structure. These methods often struggle when confronted with variations in element names, formats, or hierarchical layouts. In contrast, the semantic similarity of semi-structured data, such as JSON documents, remains underexplored, despite its importance in capturing the true meaning conveyed by document values. This paper addresses the problem of performing fuzzy joins between JSON documents by comparing their semantic content rather than their structural form. We propose and describe several methods based on document embeddings, aiming to capture the meaning of a document from its values and contextual relationships. The proposed techniques offer a promising foundation for semantic joining tasks in semi-structured data environments.
Open AccessComputation of fuzzy joins over large collections of JSON data using semantic similarity
In recent years, fuzzy joins have emerged as a critical tool in data integration, data cleaning, and similarity-based retrieval tasks, especially when dealing with noisy or heterogeneous data. Although fuzzy joins have been widely explored for relational data, existing approaches typically focus on textual similarity, matching records based on certain text values and text distances. Apart from relational data, syntactic similarity of XML and JSON documents has also been investigated, where the matching documents are compared over their hierarchical structure. These methods often struggle when confronted with variations in element names, formats, or hierarchical layouts. In contrast, the semantic similarity of semi-structured data, such as JSON documents, remains underexplored, despite its importance in capturing the true meaning conveyed by document values. This paper addresses the problem of performing fuzzy joins between JSON documents by comparing their semantic content rather than their structural form. We propose and describe several methods based on document embeddings, aiming to capture the meaning of a document from its values and contextual relationships. The proposed techniques offer a promising foundation for semantic joining tasks in semi-structured data environments.
- 22 September 2025
- Published by Pokrajinski arhiv Maribor in Moderna arhivistika
- Vol. 8 (1) , 93
Describing Corfu Criminal Court Archives Using RiC-CM
In the General State Archives of Corfu, a substantial archives of the Corfu Criminal Court is preserved, containing details of court trials dating back to 1700. Covering the period from 1815 to 1864, the Criminal Court fonds consists of 275 files containing court records from the period of the Ionian State. Among these, researchers will find 2,698 case files from the Criminal Court “Processi Corte Criminale” which were selected for this study. In particular, this work focuses on describing the Archives of Corfu’s Criminal Court (and specifically describing the homicide cases) during the period of the Ionian State (1815-1864) using the Records in Contexts Conceptual Model, a high-level conceptual model developed by the International Council on Archives (ICA) for the definition of archives, records and other related entities.
- 22 September 2025
- Published by Pokrajinski arhiv Maribor in Moderna arhivistika
- Vol. 8 (1) , 93
Describing Corfu Criminal Court Archives Using RiC-CM
In the General State Archives of Corfu, a substantial archives of the Corfu Criminal Court is preserved, containing details of court trials dating back to 1700. Covering the period from 1815 to 1864, the Criminal Court fonds consists of 275 files containing court records from the period of the Ionian State. Among these, researchers will find 2,698 case files from the Criminal Court “Processi Corte Criminale” which were selected for this study. In particular, this work focuses on describing the Archives of Corfu’s Criminal Court (and specifically describing the homicide cases) during the period of the Ionian State (1815-1864) using the Records in Contexts Conceptual Model, a high-level conceptual model developed by the International Council on Archives (ICA) for the definition of archives, records and other related entities.
- 13 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 01-06
Scalable Computation of Fuzzy Joins Over Large Collections of JSON Data
Fuzzy joins are widely used in a variety of data analysis applications such as data integration, data mining, and master data management. In the context of Big Data, computing fuzzy joins is challenging due to the high computational cost required and the communication cost. While on one hand big fuzzy joins on relational data and on the other hand joins on tree-structured data have been investigated in the literature, to the best of our knowledge, combining the two is still an open problem. In this context, we study methods for leveraging distributed environments in order to compute fuzzy joins over large collections of JSON documents. Our algorithms take into account both the text-similarity of the joining data, as well as its structural similarity.
- 13 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 01-06
Scalable Computation of Fuzzy Joins Over Large Collections of JSON Data
Fuzzy joins are widely used in a variety of data analysis applications such as data integration, data mining, and master data management. In the context of Big Data, computing fuzzy joins is challenging due to the high computational cost required and the communication cost. While on one hand big fuzzy joins on relational data and on the other hand joins on tree-structured data have been investigated in the literature, to the best of our knowledge, combining the two is still an open problem. In this context, we study methods for leveraging distributed environments in order to compute fuzzy joins over large collections of JSON documents. Our algorithms take into account both the text-similarity of the joining data, as well as its structural similarity.
- 13 February 2023
- Published by Elsevier in Information Systems
- Vol. 115
Efficient query evaluation techniques over large amount of distributed linked data
- 13 February 2023
- Published by Elsevier in Information Systems
- Vol. 115
Efficient query evaluation techniques over large amount of distributed linked data
- Open Access
Evaluating Continuous Basic Graph Patterns over Dynamic Link Data Graphs
In this paper, we investigate the problem of evaluating Basic Graph Patterns (BGP, for short, a subclass of SPARQL queries) over dynamic Linked Data graphs; i.e., Linked Data graphs that are continuously updated. We consider a setting where the updates are continuously received through a stream of messages and support both insertions and deletions of triples (updates are straightforwardly handled as a combination of deletions and insertions). In this context, we propose a set of in-memory algorithms minimizing the cached data for efficiently and continuously answering main subclasses of BGP queries. The queries are typically submitted into a system and continuously result the delta answers while the update messages are processed. Consolidating all the historical delta answers, the algorithms ensure that the answer of each query is constructed at any given time.
Open AccessEvaluating Continuous Basic Graph Patterns over Dynamic Link Data Graphs
In this paper, we investigate the problem of evaluating Basic Graph Patterns (BGP, for short, a subclass of SPARQL queries) over dynamic Linked Data graphs; i.e., Linked Data graphs that are continuously updated. We consider a setting where the updates are continuously received through a stream of messages and support both insertions and deletions of triples (updates are straightforwardly handled as a combination of deletions and insertions). In this context, we propose a set of in-memory algorithms minimizing the cached data for efficiently and continuously answering main subclasses of BGP queries. The queries are typically submitted into a system and continuously result the delta answers while the update messages are processed. Consolidating all the historical delta answers, the algorithms ensure that the answer of each query is constructed at any given time.
- Open Access
Efficient query evaluation techniques over large amount of distributed linked data
As RDF becomes more widely established and the amount of linked data is rapidly increasing, the efficient querying of large amount of data becomes a significant challenge. In this paper, we propose a family of algorithms for querying large amount of linked data in a distributed manner. These query evaluation algorithms are independent of the way the data is stored, as well as of the particular implementation of the query evaluation. We then use the MapReduce paradigm to present a distributed implementation of these algorithms and experimentally evaluate them, although the algorithms could be straightforwardly translated into other distributed processing frameworks. We also investigate and propose multiple query decomposition approaches of Basic Graph Patterns (subclass of SPARQL queries) that are used to improve the overall performance of the distributed query answering. A deep analysis of the effectiveness of these decomposition algorithms is also provided.
Open AccessEfficient query evaluation techniques over large amount of distributed linked data
As RDF becomes more widely established and the amount of linked data is rapidly increasing, the efficient querying of large amount of data becomes a significant challenge. In this paper, we propose a family of algorithms for querying large amount of linked data in a distributed manner. These query evaluation algorithms are independent of the way the data is stored, as well as of the particular implementation of the query evaluation. We then use the MapReduce paradigm to present a distributed implementation of these algorithms and experimentally evaluate them, although the algorithms could be straightforwardly translated into other distributed processing frameworks. We also investigate and propose multiple query decomposition approaches of Basic Graph Patterns (subclass of SPARQL queries) that are used to improve the overall performance of the distributed query answering. A deep analysis of the effectiveness of these decomposition algorithms is also provided.
- 1 April 2022
- Published by Springer Nature
- p. 370-381
Digitizing, Transcribing and Publishing the Handwritten Music Score Archives of Ionian Islands Philharmonic Bands
- 1 April 2022
- Published by Springer Nature
- p. 370-381
Digitizing, Transcribing and Publishing the Handwritten Music Score Archives of Ionian Islands Philharmonic Bands