scientific article

zbMATH Open0777.68014MaRDI QIDQ4023862FDOQ4023862

Kari-Jouko Raeihae, Heikki Mannila

Publication date: 23 January 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

query languagesphysical designschema transformationdatabase designobject-oriented data modelsrelational data modellogical designentity-relationship model

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)

Cited In (45)

• Database Repairing and Consistent Query Answering
• Attribute-incremental construction of the canonical implication basis
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Horn approximations of empirical data
• Design of logical database structure for data handling systems
• Approximate inference of functional dependencies from relations
• Three views on dependency covers from an FCA perspective
• BCNF via Attribute Splitting
• Computations with finite closure systems and implications
• Title not available (Why is that?)
• Database Schema Design In The Relational Model
• Autonomous sets for the hypergraph of all canonical covers
• Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
• Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
• Closure via functional dependence simplification
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
• Title not available (Why is that?)
• The multiple facets of the canonical direct unit implicational basis
• On functional dependencies in \(q\)-Horn theories
• Asymptotic properties of keys and functional dependencies in random databases
• Inclusion dependencies and their interaction with functional dependencies in SQL
• Understanding database design expertise
• Functional dependencies are helpful for partial materialization of data cubes
• Towards declarative comparabilities: application to functional dependencies
• Minimal-change integrity maintenance using tuple deletions
• Translating between the representations of a ranked convex geometry
• Discovering functional and inclusion dependencies in relational databases
• Performance model of database relationship to design and manufacturing
• On Dependence Logic
• The synthesis approach for relational database design: An expanded perspective
• Tableaux for functional dependencies and independencies
• Framework design of a domain-key schema of a relational database
• Functional and approximate dependency mining: database and FCA points of view
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
• Controlling entity integrity with key sets
• Title not available (Why is that?)
• Computing Dependencies Using FCA
• A relational database system architecture based on a vector-processing method
• Succinctness and tractability of closure operator representations
• The joy of implications, aka pure Horn formulas: mainly a survey
• Semistructured Database Design
• Optimizations in computing the Duquenne-Guigues basis of implications
• Normal forms and syntactic completeness proofs for functional independencies
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Some Remarks on Relational Database Schemes Having Few Minimal Keys

This page was built for publication:

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