Targeted least cardinality candidate key for relational databases

DOI10.4230/LIPICS.ICDT.2025.21MaRDI QIDQ7292789zbMATH OpenFDO

Authors Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.21

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A fast algorithm for equitable coloring
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• A threshold of ln n for approximating set cover
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Analytical approach to parallel repetition
• Approximating minimum keys and optimal substructure screens
• Candidate keys for relations
• Depth-First Search and Linear Graph Algorithms
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Everywhere-sparse spanners via dense subgraphs
• Functional Dependencies in a Relational Database and Propositional Logic
• Graph Algorithms for Functional Dependency Manipulation
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3898274 (Why is no real title available?)
• scientific article; zbMATH DE number 3911762 (Why is no real title available?)
• scientific article; zbMATH DE number 3558979 (Why is no real title available?)
• scientific article; zbMATH DE number 1256762 (Why is no real title available?)
• scientific article; zbMATH DE number 2021404 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Intractability of assembly sequencing: unit disks in the plane
• Minimizing the union: tight approximations for small set bipartite vertex expansion
• Minimum propositional proof length is NP-hard to linearly approximate
• On the ratio of optimal integral and fractional covers
• Random Graphs and Networks: A First Course
• Reducibility among combinatorial problems
• The design of approximation algorithms
• The Randomized Coloring Procedure with Symmetry-Breaking
• Trends in cleaning relational data: consistency and deduplication
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

This page was built for publication: Targeted least cardinality candidate key for relational databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292789)