Accessibility and rooting algorithm for a hypergraph relational database

2001 
Hypergraph database theory is a new kind of database theory to describe relational schemes. The hypergraph database is based on graph theory. An accessibility algorithm, a search algorithm and a decomposing algorithm are imported into database applications to find the functional dependence and the
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []