A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes

叶新铭 · 1994

Acyclic databases possess several desirable properties for their design and use.A distributed algorithm is proposed for determining a minimal cover of an alpha-,beta-,gamma-,or Berge-acyclic database scheme over a set of attributes in a distributed environment.

Read the paper · More papers on PaperTik