4 citations · 6 across the 11 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2026
Listing Even Cycles Faster than the Submodular-Width Barrier
Vasileios Nakos, Hung Q. Ngo, Andreas Panayi
A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all -cycles in an -edge graph can be listed in time, where is the…
cs.DB2025
Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu +1
Estimating the cardinality of the output of a query is a fundamental problem in database query processing. In this article, we overview a recently published contribution that casts…
cs.DB2024
Targeted Least Cardinality Candidate Key for Relational Databases
Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
Functional dependencies (FDs) are a central theme in databases, playing a major role in the design of database schemas and the optimization of queries. In this work, we introduce t…