scientific article; zbMATH DE number 3823168

zbMATH Open0519.68082MaRDI QIDQ3668890FDOQ3668890

David Maier

Publication date: 1983

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

zbMATH Keywords

normal formquery languagesfunctional dependenciesjoin dependenciesrelational algebradependencyrelational databasedatabase queriesdatabase scheme

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• Attribute exploration with background knowledge
• Derivation digraphs for dependencies in ordinal and similarity-based data
• A Generalization of the Inference Rules for Join Dependencies in Databases
• Local and global relational consistency
• Probability propagation
• On computing minimal independent support and its applications to sampling and counting
• Extended Static Checking by Calculation Using the Pointfree Transform
• A relation-algebraic approach to the ``Hoare logic of functional dependencies
• Constraint-generating dependencies
• Approximate inference of functional dependencies from relations
• Finite-model theory -- A personal perspective
• Uniform Constraint Satisfaction Problems and Database Theory
• Reformulation of global constraints based on constraints checkers
• Autonomous sets for the hypergraph of all canonical covers
• Tractable constraints on ordered domains
• Fast algorithms for implication bases and attribute exploration using proper premises
• On keys and normal forms
• On improving dependency implication algorithms
• The multiple facets of the canonical direct unit implicational basis
• The implication problem for `closest node' functional dependencies in complete XML documents
• Unifying tree decompositions for reasoning in graphical models
• A complete axiomatization of full acyclic join dependencies
• Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
• Computing unique canonical covers for simple FDs via transitive reduction
• Non first normal form relations: An algebra allowing data restructuring
• Partition semantics for relations
• A logical framework for depiction and image interpretation
• Attribute selection with fuzzy decision reducts
• On the expressive power of database queries with intermediate types
• Concept lattices and conceptual knowledge systems
• Decomposing constraint satisfaction problems using database techniques
• Domain independence and the relational calculus
• Optimal covers in the relational database model
• Design of relational database schemes by deleting attributes in the canonical decomposition
• Design by example: An application of Armstrong relations
• An incremental concept formation approach for learning from databases
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• The Dempster-Shafer calculus for statisticians
• A note on relation schemes which are in 3NF but not in BCNF
• An algebraic theory of functional and multivalued dependencies in relational databases
• A unique formal system for binary decompositions of database relations, probability distributions, and graphs
• The synthesis approach for relational database design: An expanded perspective
• Interval graphs and related topics
• Computing the minimum cover of functional dependencies
• On the size of nonredundant FD-covers
• On computing minimal models
• Representing lattices using many-valued relations
• On minimal constraint networks
• Partition search for non-binary constraint satisfaction
• Semiring induced valuation algebras: exact and approximate local computation algorithms
• Fuzzy attribute logic over complete residuated lattices
• Tree clustering for constraint networks
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• Granularity of attributes in formal concept analysis
• On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras
• On critical sets of a finite Moore family
• Propagating belief functions in qualitative Markov trees
• Title not available (Why is that?)
• Algorithmic aspects of intersection graphs and representation hypergraphs
• A linear algebra approach to OLAP
• Set-based representations of conjunctive and disjunctive knowledge
• Hydras: directed hypergraphs and Horn formulas
• Succinctness and tractability of closure operator representations
• The joy of implications, aka pure Horn formulas: mainly a survey
• Functional dependencies in relational databases: A lattice point of view
• On the complexity of enumerating pseudo-intents
• The logic of constraint satisfaction
• Optimizations in computing the Duquenne-Guigues basis of implications
• Using powerdomains to generalize relational databases
• Minimum implicational basis for \(\wedge\)-semidistributive lattices
• Structure identification in relational data
• Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
• Uncovering trees in constraint networks
• Information Algebra
• Recursive conditioning
• On minimal sets of graded attribute implications
• Fuzzy logic programming reduced to reasoning with attribute implications
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• Decomposability of partially defined Boolean functions
• Attribute dependencies for data with grades I^,
• Attribute-incremental construction of the canonical implication basis
• Fuzzy inequational logic
• Decomposing a relation into a tree of binary relations
• Cycle structure of edge labelled graphs
• Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
• Decision bireducts and decision reducts -- a comparison
• Boyce-Codd normal form and object normal forms
• Join sizes, urn models and normal limiting distributions
• A semantics for complex objects and approximate answers
• Algebraization of inferring functional dependences in relational databases
• Cheap Boolean Role Constructors for Description Logics
• Database placement in communication networks for minimizing the overall transmission cost
• Fuzzy functional dependencies: a comparative survey
• Query languages for hierarchic databases
• Structure of closures in relational schemas with join and functional dependencies
• A semantic approach to optimize linear datalog programs
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
• RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS

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 Q3668890)