Skip to main content
SpringerLink
Log in

NP-complete problems simplified on tree schemas

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A schema is a collection of finite subsets of a set. One can partition the class of all schemas into tree schemas and cyclic schemas. This partitioning has been extensively studied in relational database theory. In this paper we examine the impact of tree schemas on some NP-complete problems. We show that tree schema instances can be efficiently solved (i.e., polynomially) for certain NP-complete problems.

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

Access this article

Log in via an institution

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

References

  1. Berge, C.: Graphs and Hypergraphs. North Holland Publishing Co. 1973

  2. Buneman, P.: A Characterization of Rigid Circuit Graphs. Discrete Math. 9, 205–212 (1974)

    Google Scholar 

  3. Bernstein, P.A., Chiu, D.W.: Using Semi-Joins to Solve Relational Queries. J. ACM 28 (1), 25–40 (1981)

    Google Scholar 

  4. Beeri, C., Fagin, R., Maier, D., Mendelzon, A., Ullman, J.D., Yannakakis, M.: Properties of Acyclic Database Schemas. Proc. Thirteenth Annual ACM Symp. on Theory of Computation, pp. 355–362,

  5. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the Desirability of Acyclic Database Schemas. J. ACM (to appear)

  6. Bernstein, P.A., Goodman, N.: The Power of Natural Semijoins. SIAM J. Comput. 10 (4) (1981)

  7. Chase, K.: Join Graphs and Acyclic Data Base Schemas. Proc. VLDB, pp.95–100, 1981

  8. Chiu, D.M., Ho, Y.C.: A Methodology for Interpreting Tree Queries into Optimal Semi-Join Expressions. Proc. ACM SIGMOD Int. Conf. Management of Data (Santa Monica, CA, May 14–16), New York: ACM, pp. 169–178, 1980

    Google Scholar 

  9. Fagin, R.: Types of Acyclicity for Hypergraphs and Relational Database Schemes. IBM Res. Rep. RJ3330, 1981

  10. Fagin, R., Mendelzon, A., Ullman, J.D.: A Simplified Universal Relation Assumption and Its Properties. ACM Trans. Database Syst. (to appear)

  11. Gavril, F.: Algorithm for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of Chordal Graph. SIAM J. Comput. (1), 1972

  12. Graham, M.H.: On the Universal Relation. Technical Report, Univ. of Toronto, 1979

  13. Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W.H., and Company, San Francisco, 1979

    Google Scholar 

  14. Goodman, N., Shmueli, O.: The Tree Property is Fundamental for Query Processing. Proc. ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, 1982

  15. Goodman, N., Shmueli, O.: Transforming Cyclic Schemas into Trees. Proc. ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, 1982

  16. Goodman, N., Shmueli, O.: Tree Queries: A Simple Class of Relational Queries. ACM Trans. Database Syst. 7(4), 653–677 (1982)

    Google Scholar 

  17. Goodman, N., Shmueli, O.: Syntactic Characterizations of Tree Database Schemas. J. ACM (to appear)

  18. Honeyman, P.: Properties of the Universal Relation Assumption. Ph. D. Thesis, Princeton Univ., Princeton, N.J. 1980

    Google Scholar 

  19. Hull, R.: Acyclic Join Dependencies and Database Projections. J. Comput. System Sci. (to appear)

  20. Honeyman, P., Ladner, R.E., Yannakakis, M.: Testing the Universal Instance Assumption. Information Processing Lett. 20(1), 14–19 (1980)

    Google Scholar 

  21. Kambayashi, Y., Yoshikawa, M.: Query Processing Utilizing Dependencies and Horizontal Decomposition. Proc. 1983 ACM-SIGMOD Conf. on Management of Data, 1983

  22. Maier, D., Ullman, J.D.: Connections in Acyclic Hypergraphs. Proc. ACM Symp. Principles of Database Systems (Los Angeles, March 29–31, 1982), ACM, New York, pp. 34–39, 1982

    Google Scholar 

  23. Maier, D., Ullman, J.D.: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. (to appear)

  24. Ullman, J.D.: The U.R. Strikes Back. Proc. ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, 1982

  25. Yannakakis, M.: Algorithms for Acyclic Database Schemes. Proc. VLDB, 82–94, Cannes, France, 1981

  26. Yu, C.T., Ozsoyoglu, M.X.: An Algorithms for Tree-Query Membership of a Distributed Query. Proc. COMPSAC79, IEEE Comp. Soc. 1979, pp. 306–312

Download references

Author information

Authors and Affiliations

  1. Center for Research in Computing Technology, Harvard University, Ailxen Computation Laboratory, 02138, Cambridge, MA, USA

    N. Goodman & O. Shmueli

Authors
  1. N. Goodman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Shmueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goodman, N., Shmueli, O. NP-complete problems simplified on tree schemas. Acta Informatica 20, 171–178 (1983). https://doi.org/10.1007/BF00289414

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation