scientific article

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

normal form relational database relational algebra query languages functional dependencies join dependencies dependency database queries database scheme

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (only showing first 100 items - show all)

Attribute transformations for data mining I: Theoretical explorations ⋮ SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ Computing Dependencies Using FCA ⋮ Formal Methods in FCA and Big Data ⋮ A Generalization of the Inference Rules for Join Dependencies in Databases ⋮ Estimating optimal parameters for parallel database hardware ⋮ Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects ⋮ Boolean invariants of databases ⋮ Structure of closures in relational schemas with join and functional dependencies ⋮ Knowledge base dynamics, abduction, and database updates ⋮ A Correspondence Between Variable Relations And Three-Valued Propositional Logic ⋮ A paraconsistent relational data model ⋮ Passive and active rules in deductive databases ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ Computations with finite closure systems and implications ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ Representations for the largest extension of a closure system ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Three views on dependency covers from an FCA perspective ⋮ Weak Cartesian properties of simplicial sets ⋮ Optimal nonparametric testing of missing completely at random and its connections to compatibility ⋮ Toward a general theory of reasoning with uncertainty. I: Nonspecificity and fuzziness ⋮ Unnamed Item ⋮ Cheap Boolean Role Constructors for Description Logics ⋮ Unnamed Item ⋮ A category theory approach to conceptual data modeling ⋮ Unnamed Item ⋮ ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS ⋮ Closure via functional dependence simplification ⋮ GLOBAL PROPAGATION IN BAYESIAN NETWORKS VS SEMIJOIN PROGRAMS IN RELATIONAL DATABASES ⋮ Fuzzy rough set techniques for uncertainty processing in a relational database ⋮ UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS ⋮ Extending the relational model to deal with probabilistic data ⋮ Recursive conditioning ⋮ Diagnosing tree-structured systems ⋮ Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ⋮ Extended Static Checking by Calculation Using the Pointfree Transform ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Lossless Decompositions in Complex-Valued Databases ⋮ Acquiring Generalized Domain-Range Restrictions ⋮ Lexico-Logical Acquisition of OWL DL Axioms ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the Merge of Factor Canonical Bases ⋮ Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs ⋮ Normal forms and syntactic completeness proofs for functional independencies ⋮ Formal methods for verification of websites macrostructure integrity ⋮ Tractable constraints on ordered domains ⋮ Graded LinClosure and Its Role in Relational Data Analysis ⋮ Automated prover for attribute dependencies in data with grades ⋮ Tractable constraints on ordered domains ⋮ Querying Weak Instances Under Extension Chase Semantics: A Complete Solution ⋮ Incorporating an implicit time dimension into the relational model and algebra ⋮ Information Algebra ⋮ Uniform Constraint Satisfaction Problems and Database Theory ⋮ A theory of data dependencies over relational expressions ⋮ Approximating Minimum Representations of Key Horn Functions ⋮ The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Computing sets of graded attribute implications with witnessed non-redundancy ⋮ Constraints on fuzzy values and fuzzy functional dependencies ⋮ Join sizes, urn models and normal limiting distributions ⋮ Logic of temporal attribute implications ⋮ A note on relation schemes which are in 3NF but not in BCNF ⋮ A calculus for containment of fuzzy attributes ⋮ Domain independence and the relational calculus ⋮ Formation of hypercube representation of relational database ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Computing the least common subsumer w.r.t. a background terminology ⋮ Partition search for non-binary constraint satisfaction ⋮ An incremental concept formation approach for learning from databases ⋮ Aggregate operations in the information source tracking method ⋮ Optimization of a subclass of conjunctive queries ⋮ Weighted 2-sections and hypergraph reconstruction ⋮ Insertion anomalies and the justification for 4NF in relational databases ⋮ Characterization of desirable properties of general database decompositions. ⋮ Static and dynamic aspects of goal-oriented concurrency control ⋮ Probability propagation ⋮ Positive and Horn decomposability of partially defined Boolean functions ⋮ Decomposability of partially defined Boolean functions ⋮ Attribute-incremental construction of the canonical implication basis ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ A logical design method for relational databases based on generalization and aggregation semantics ⋮ Representing lattices using many-valued relations ⋮ Unnamed Item ⋮ RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS ⋮ Decision bireducts and decision reducts -- a comparison ⋮ On computing minimal models ⋮ Probabilistic databases for decision analysis ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ A first step towards implementing dynamic algebraic dependences ⋮ A corrected 5NF definition for relational database design ⋮ Local and global relational consistency ⋮ Uncovering trees in constraint networks ⋮ Fuzzy functional dependencies and Bayesian networks ⋮ Unnamed Item ⋮ Attribute dependencies for data with grades I^, ⋮ A machine learning method to reveal closed sets of common features of objects using constraint programming

This page was built for publication: