A distributed algorithm for determining minimal covers of acyclic database schemes (Q1333367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A distributed algorithm for determining minimal covers of acyclic database schemes |
scientific article; zbMATH DE number 638740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed algorithm for determining minimal covers of acyclic database schemes |
scientific article; zbMATH DE number 638740 |
Statements
A distributed algorithm for determining minimal covers of acyclic database schemes (English)
0 references
13 September 1994
0 references
acyclic databases
0 references
depth-first-search tree
0 references
distributed algorithm
0 references
minimal cover
0 references
hypergraph
0 references
Berge-acyclic database
0 references
distributed environment
0 references
0.8654929995536804
0 references
0.7899103760719299
0 references
0.737144410610199
0 references
0.7351324558258057
0 references
