On the Desirability of Acyclic Database Schemes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A linear time recognition algorithm for proper interval graphs
- Laminar structure of ptolemaic graphs with applications
- Local consistency for extended CSPs
- Estimating high-dimensional intervention effects from observational data
- Canonical and monophonic convexities in hypergraphs
- On the notion of cycles in hypergraphs
- NP-complete problems simplified on tree schemas
- On the existence of acyclic views in a database scheme
- Interval graphs and related topics
- The tree projection theorem and relational query processing
- Distributed revision of composite beliefs
- Existence of extensions and product extensions for discrete probability distributions
- Interaction-free multivalued dependency sets
- On hypergraph acyclicity and graph chordality
- Tree clustering for constraint networks
- Simplicial decompositions of graphs: A survey of applications
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Recognizing single-peaked preferences on a tree
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- Relational decomposition and structural analysis of systems
- Inferring multivalued dependencies from functional and join dependencies
- An inertia formula for Hermitian matrices with sparse inverses
- Design of desirable relational database schemes
- Structure identification in relational data
- Studies on hypergraphs. I: Hyperforests
- Counting clique trees and computing perfect elimination schemes in parallel
- A characterization of finite fd-acyclicity
- A fast algorithm for query optimization in universal-relation databases
- Approximations for subset interconnection designs
- Minimal vertex separators of chordal graphs
- Paths and cycles of hypergraphs
- Unique complements and decompositions of database schemata
- Decomposing constraint satisfaction problems using database techniques
- Optimal distributed execution of join queries
- The parallel solution of domination problems on chordal and strongly chordal graphs
- A distributed algorithm for determining minimal covers of acyclic database schemes
- Incorporating processor costs in optimizing the distributed execution of join queries
- Characterization of desirable properties of general database decompositions.
- Probability propagation
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- A special case for subset interconnection designs
- The cyclicity of a hypergraph
- On computing minimal models
- Local and global relational consistency
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Fuzzy functional dependencies and Bayesian networks
- An alternative characterization of a Bayesian network.
- Decomposition of a hypergraph by partial-edge separators
- A practical algorithm for making filled graphs minimal
- A comparison of structural CSP decomposition methods
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Counting acyclic hypergraphs
- Structure learning in Bayesian networks using regular vines
- The power of propagation: when GAC is enough
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Clique trees of infinite locally finite chordal graphs
- Homology cycles and dependent cycles of hypergraphs
- Evaluating multiple join queries in a distributed database system
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers
- The existence condition of \(\gamma\)-acyclic database schemes with MVDs constraints.
- Enumeration of maximum acyclic hypergraphs
- An algorithm for handling many relational calculus queries efficiently.
- Executing join queries in an uncertain distributed environment
- Allocating relations in a distributed database system
- Comments on: Sequences of regressions and their independences
- Structural learning about directed acyclic graphs from multiple databases
- Decomposable convexities in graphs and hypergraphs
- Compatibility, desirability, and the running intersection property
- Berge-acyclic multilinear 0-1 optimization problems
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- Weighted 2-sections and hypergraph reconstruction
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Bayesian networks: the minimal triangulations of a graph
- View-based propagator derivation
- On matrices, automata, and double counting in constraint programming
- An algorithm for determining minimal reduced-coverings of acyclic database schemes
- Optimal decomposition by clique separators
- A faster algorithm to recognize undirected path graphs
- Local computations in Dempster-Shafer theory of evidence
- Domain permutation reduction for constraint satisfaction problems
- On the expressive power of semijoin queries
- Treewidth computation and extremal combinatorics
- Mixed covering arrays on 3-uniform hypergraphs
- Reasoning about functional and full hierarchical dependencies over partial relations
- An efficient representation of chordal graphs
- Searching for better fill-in
- Decomposition of structural learning about directed acyclic graphs
- Unifying tree decompositions for reasoning in graphical models
- Tree decomposition and discrete optimization problems: a survey
- On axioms constituting the foundation of hypergraph theory
- Decomposability of abstract and path-induced convexities in hypergraphs
- An invariant for hypergraphs
- The semijoin algebra and the guarded fragment
- Prediction-hardness of acyclic conjunctive queries
- The dynamic complexity of acyclic hypergraph homomorphisms
This page was built for publication: On the Desirability of Acyclic Database Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026382)