Degrees of acyclicity for hypergraphs and relational database schemes
From MaRDI portal
Publication:3026383
DOI10.1145/2402.322390zbMath0624.68088MaRDI QIDQ3026383
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2402.322390
hypergraphs; relational database; join dependency; database schemes; degree of acyclicity; loop-free Bachman diagram
Related Items
METASYSTEMS AND THE MAXIMUM ENTROPY PRINCIPLE, Chordality properties on graphs and minimal conceptual connections in semantic data models, Lossless outer joins with incomplete information, On some partial line graphs of a hypergraph and the associated matroid, Hypertree decompositions and tractable queries, GYO reductions, canonical connections, tree and cyclic schemas, and tree projections, Recognizing different types of beta-cycles in a database scheme, Reformulation of global constraints based on constraints checkers, Hierarchical fault diagnosis for discrete-event systems under global consistency, Testing arbitrary subhypergraphs for the lossless join property, An algebra of probability over finite product spaces, with applications, Laminar structure of ptolemaic graphs with applications, 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, Interaction-free multivalued dependency sets, On the desirability of \(\gamma\)-acyclic BCNF database schemes, On hypergraph acyclicity and graph chordality, Algorithmic aspects of intersection graphs and representation hypergraphs, A note on odd/even cycles, Relational decomposition and structural analysis of systems, Connection-trap-free database schemes, Generating hinges from arbitrary subhypergraphs, Inferring null join dependencies in relational databases, On winning strategies in Ehrenfeucht-Fraïssé games, A fast algorithm for query optimization in universal-relation databases, 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, Incorporating processor costs in optimizing the distributed execution of join queries, The nested universal relation data model, Characterization of desirable properties of general database decompositions., Minimizing the response time of executing a join between fragmented relations in a distributed database system, Evaluating multiple join queries in a distributed database system, Optimisation and hypergraph theory, The existence condition of \(\gamma\)-acyclic database schemes with MVDs constraints., An algorithm for handling many relational calculus queries efficiently., The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs, Executing join queries in an uncertain distributed environment, Allocating relations in a distributed database system, Optimising the distributed execution of join queries in polynomial time, Database query processing using finite cursor machines, An algorithm for determining minimal reduced-coverings of acyclic database schemes, Doubly lexical ordering of dense 0--1 matrices, A faster algorithm to recognize undirected path graphs, Domain permutation reduction for constraint satisfaction problems, Prediction-hardness of acyclic conjunctive queries, Entity-relationship diagrams which are in BCNF, How to draw a hypergraph, On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay, Subdivision Drawings of Hypergraphs, UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS, LATTICES OF STRUCTURE MODELS AND DATABASE SCHEMES, Unnamed Item
