Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computing and Information

ICCI 1990: Advances in Computing and Information — ICCI '90 pp 120–128Cite as

Finding two-tree-factor elements of tableau-defined monoids in time O(n 3)

  • Theory Of Computing, Algorithms And Programming
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Abstract

We consider the problem of finding elements in tableau-defined monoids. The solution of this problem is important to the minimization of restricted relational database queries. Although the problem has been shown to be NP-complete in general, many polynomial-time algorithms have been proposed for some subclasses of the general problem. The contribution of this paper is a new algorithm that finds elements with two-tree-factors in time O(n 3). The number of elements that can be found in polynomial time is significantly increased by our algorithm as compared with the algorithms known so far.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abramowitz and I. A. Stegun, editors. Handbook of mathematical functions. Dover Publications, Inc., New York, 1965.

    Google Scholar 

  2. A. V. Aho, Y. Sagiv, and J. D. Ullman. Effizient optimization of a class of relational expressions. ACM Trans. Database Syst., 4(4):435–454, December 1979.

    Google Scholar 

  3. A. V. Aho, Y. Sagiv, and J. D. Ullman. Equivalences among relational expressions. SIAM J. Comput., 8(2):218–246, May 1979.

    Google Scholar 

  4. B. Harris and L. Schoenfeld. The number of idempotent elements in symmetric semigroups. Journal of Combinatorial Theory, 3(2):122–135, September 1967.

    Google Scholar 

  5. A. P. Heinz. Optimization of Relational Algebra Queries. Master's thesis, Rheinisch-Westfälische Technische Hochschule Aachen, March 1984. in German.

    Google Scholar 

  6. A. P. Heinz and G. Vossen. Quadratic-time optimization of SPJ-expressions including inequality selections by tableaux. Fundamenta Informaticae VIII, 8(3–4):397–414, 1985.

    Google Scholar 

  7. Y. Sagiv. Quadratic algorithms for minimizing joins in restricted relational expressions. SIAM J. Comput., 12(2):316–328, May 1983.

    Google Scholar 

  8. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633–655, October 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Rheinstraße 10–12, D-7800, Freiburg

    Alois P. Heinz

Authors
  1. Alois P. Heinz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heinz, A.P. (1991). Finding two-tree-factor elements of tableau-defined monoids in time O(n 3). In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation