Skip to main content
Springer Nature Link
Log in

The existence condition of γ-acyclic database schemes with MVDs constraints

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

It is very important to use database technology for a large-scale system such as ERP and MIS. A good database design may improve the performance of the system. Some researches show that a γ-acyclic database scheme has many good properties, e.g., each connected join expression is monotonous, which helps to improve query performance of the database system. This what conditions are needed to generate a γ-acyclic database scheme for a given relational scheme? In this paper, the sufficient and necessary condition of the existence of γ-acyclic, join-lossless and dependencies-preserved database schemes meeting 4NF is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Beeri C, Fagin R. On the desirability of acyclic database schemes.J. ACM., 1983, 30(3): 479–513.

    Article  MATH  MathSciNet  Google Scholar 

  2. Fagin R. Degrees of acyclicity for hypergraphs and relational database schemes.J. ACM., 1983, 30(3): 514–550.

    Article  MATH  MathSciNet  Google Scholar 

  3. Lien Y E. On the equivalence of database models.J. ACM., 1982, 29(2): 333–362.

    Article  MATH  MathSciNet  Google Scholar 

  4. Biskup J. Towards designing acyclic database schemes.Advances in Database Theory, 1982, 2: 3–24.

    Google Scholar 

  5. Cheung T Y, Zhu Y Z. Recognizing different types of beta-cycles in a database scheme.Theoretical Computer Science, 1991, 81: 295–304.

    Article  MATH  MathSciNet  Google Scholar 

  6. Liu Wenyuan, Hao Zhongxiao. Study of database schema decomposition of conflict free, meeting P4 and β-acyclic.Computer Research and Development, 2000, 37(2): 170–174.

    Google Scholar 

  7. Zhu Yunzhou. Line graph of gamma-acyclic database schemes and its recognition algorithm.Chinese Journal of Computers, 1985, 8(4): 241–247.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Engineering, Harbin Institute of Technology, 150001, Harbin, P.R. China

    Hao Zhongxiao & Yao Chunlong

  2. Department of Computer and Technology, Qiqihar University, 161006, Qiqihar, P.R. China

    Hao Zhongxiao & Yao Chunlong

  3. School of Computer and Control, Harbin University of Science and Technology, 150080, Harbin, P.R. China

    Hao Zhongxiao

Authors
  1. Hao Zhongxiao
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yao Chunlong
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This work is supported by Natural Science Foundation of Heilongjiang Province under the project of “Organization of Acyclic Databases”, No.F00-06.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhongxiao, H., Chunlong, Y. The existence condition of γ-acyclic database schemes with MVDs constraints. J. Comput. Sci. & Technol. 17, 517–521 (2002). https://doi.org/10.1007/BF02943293

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943293

Keywords