Christos Koutras
Christos Koutras
PhD Candidate, Technische Universiteit Delft, Netherlands
Verified email at
Cited by
Cited by
Valentine: Evaluating matching techniques for dataset discovery
C Koutras, G Siachamis, A Ionescu, K Psarakis, J Brons, M Fragkoulis, ...
2021 IEEE 37th International Conference on Data Engineering (ICDE), 468-479, 2021
Data lakes: A survey of functions and systems
R Hai, C Koutras, C Quix, M Jarke
IEEE Transactions on Knowledge and Data Engineering, 2023
REMA: Graph Embeddings-based Relational Schema Matching
C Koutras, M Fragkoulis, A Katsifodimos, C Lofi
Workshop Proceedings of the EDBT/ICDT 2020 Joint Conference, 4, 2020
Amalur: Data integration meets machine learning
Z Li, W Sun, D Zhan, Y Kang, L Chen, A Bozzon, R Hai
IEEE Transactions on Knowledge and Data Engineering, 2024
Valentine in Action: Matching Tabular Data at Scale
C Koutras, K Psarakis, G Siachamis, A Ionescu, M Fragkoulis, A Bonifati, ...
Proceedings of the VLDB Endowment 14 (12), 2871-2874, 2021
Data as a Language: A Novel Approach to Data Integration
C Koutras
Proceedings of the VLDB 2019 PhD Workshop, 4, 2019
SiMa: Effective and Efficient Data Silo Federation Using Graph Neural Networks
C Koutras, R Hai, K Psarakis, M Fragkoulis, A Katsifodimos
arXiv preprint arXiv:2206.12733, 2022
Amalur: Next-generation Data Integration in Data Lakes
R Hai, C Koutras, A Ionescu, A Katsifodimos
Conference on Innovative Data Systems Research (CIDR), 2022
Probabilistic k-Nearest Neighbor Monitoring of Moving Gaussians
K Patroumpas, C Koutras
Proceedings of the 29th International Conference on Scientific and …, 2017
OmniMatch: Effective Self-Supervised Any-Join Discovery in Tabular Data Repositories
C Koutras, J Zhang, X Qin, C Lei, V Ioannidis, C Faloutsos, G Karypis, ...
arXiv preprint arXiv:2403.07653, 2024
A Novel Schema Matching Approach Based on Relational Embeddings
C Koutras, A Katsifodimos, C Lofi
Αναζήτηση k-εγγύτερων γειτόνων μεταξύ περιοχών αβεβαιότητας με κανονική κατανομή
Χ Κούτρας
The system can't perform the operation now. Try again later.
Articles 1–12