scientific article; zbMATH DE number 3823168
zbMATH Open0519.68082MaRDI QIDQ3668890FDOQ3668890
Authors: David Maier
Publication date: 1983
Title of this publication is not available (Why is that?)
normal formquery languagesfunctional dependenciesjoin dependenciesrelational algebradependencyrelational databasedatabase queriesdatabase scheme
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)
- 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
- The calculus of context relations
- On functional dependencies in \(q\)-Horn theories
- Minimal bases of temporal attribute implications
- Fuzzy data dependencies and implication of fuzzy data dependencies
- Automated prover for attribute dependencies in data with grades
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- Approximating sets with equivalence relations
- Fuzzy relations and fuzzy relational databases
- Fuzzy rough set techniques for uncertainty processing in a relational database
- On the Merge of Factor Canonical Bases
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- Extending the relational model to deal with fuzzy values
- Constraints on fuzzy values and fuzzy functional dependencies
- A theory of Gaussian belief functions
- A category theory approach to conceptual data modeling
- On the unusual effectiveness of logic in computer science
- Fuzzy functional dependencies and Bayesian networks
- Insertion anomalies and the justification for 4NF in relational databases
- Generalized domination in closure systems
- A logic of graded attributes
- Closed sets and translations of relation schemes
- Studies on hypergraphs. I: Hyperforests
- A distributed join algorithm
- A new interpretation for null values in the weak instance model
- Logic of temporal attribute implications
- A logical design method for relational databases based on generalization and aggregation semantics
- Objects in relational database schemes with functional, inclusion, and exclusion dependencies
- Aggregate operations in the information source tracking method
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- Parallel update transactions
- Semantics of types for database objects
- An algebra of probability over finite product spaces, with applications
- Testing arbitrary subhypergraphs for the lossless join property
- Paths and cycles of hypergraphs
- Toward a general theory of reasoning with uncertainty. I: Nonspecificity and fuzziness
- A note on lossless database decompositions
- Optimization of a subclass of conjunctive queries
- Enumeration of maximum acyclic hypergraphs
- A formal framework for independence with respect to transactions in the universal relation model
- Recognizing different types of beta-cycles in a database scheme
- Set-theoretic problems of null completion in relational databases
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Diagnosing tree-structured systems
- A new characterization of FD implication with an application to update anomalies
- Procedural languages for database queries and updates
- 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
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)