On sampling representatives of relational schemas with a functional dependency

DOI10.1007/978-3-031-11321-5_1OpenAlexW4285119046MaRDI QIDQ2103897

Joachim Biskup, Maximilian Berens

Publication date: 9 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-11321-5_1

zbMATH Keywords

combinatorial analysisfunctional dependencyinteger partitionrelational schemauniform probability distributioninstance similaritydomain cardinalityduplicate-freenessinstance equivalencenon-normalized schemanormalized schemarandom representativeset unificationsystem of relationships among integer variables

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Uses Software

• NumPy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method and two algorithms on the theory of partitions
• Set unification
• The Structure of Random Partitions of Large Integers
• Fast algorithms for genegrating integer partitions
• Ranking and unranking of B-trees
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example

This page was built for publication: On sampling representatives of relational schemas with a functional dependency