on the dense families in the relational datamodel
Clicks: 152
ID: 195778
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
152 views
37 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #30 of 43 articles by views in atmospheric environment
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In this paper, dense families of relation schemes are introduced. We characterize minimal keys of relation schemes in terms of dense families. Note that, the dense families of database relations were introduced by Jarvinen [6]. We prove that the set of all minimal keys of a relation scheme s= (U, F) is the transversal hypergraphs of a hypergraph D– {∅}, where Dis any s-dense family. We give a necessary and sufficient condition for an abitrary family to be s-dense family. We also present some dense families of relation schemes. Furthermore, in this paper, we also study antikeys by means of dense families. We present connections between antikeys and a dense family of relation schemes. Finally, we study the time complexity of the problem finding antikeys.
| Reference Key |
thy2017aseanon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Vu Duc Thy;Nguyen Hoang Son |
| Journal | atmospheric environment |
| Year | 2017 |
| DOI |
10.29037/ajstd.162
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.