On sampling representatives of relational schemas with a functional dependency
combinatorial analysisfunctional dependencyinteger partitionuniform probability distributionrelational schemainstance similaritydomain cardinalityduplicate-freenessinstance equivalencenon-normalized schemanormalized schemarandom representativeset unificationsystem of relationships among integer variables
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15) Logic in artificial intelligence (68T27) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
- scientific article; zbMATH DE number 1354919
- Discovery of functional and approximate functional dependencies in relational databases
- On the complexity of sampling query feedback restricted database repair of functional dependency violations
- Discovering functional and inclusion dependencies in relational databases
- Functional dependencies in relational databases: A lattice point of view
- Efficient sampling strategies for relational database operations
- Algebraization of inferring functional dependences in relational databases
- Inductive Logic Programming
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A method and two algorithms on the theory of partitions
- Analytic combinatorics
- Fast algorithms for genegrating integer partitions
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- Ranking and unranking of B-trees
- Set unification
- The Structure of Random Partitions of Large Integers
This page was built for publication: On sampling representatives of relational schemas with a functional dependency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103897)