Skip to main content
SpringerLink
Log in

Blocks and projections' synthesis in relational databases

  • Conference paper
  • First Online:
MFDBS 89 (MFDBS 1989)

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

Included in the following conference series:

  • 138 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Faigin, A.O. Mendelzon, J.D. Ullman, "A simplified universal relation assumption and its properties", ACM Trans. on DBS, 7, 3, Sept. 1982, pp. 343–360.

    Google Scholar 

  2. D. Maier, J.D. Ullman, "Maximal objects and the semantics of universal relation databases", ACM Trans. on DBS, 8, 1, March 1983, pp. 1–14.

    Google Scholar 

  3. J.Biskup, H.H.Brüggenmann, L.Schnetgöke, M.Kramer, "One flavor assumption and j-acyclicity for universal relation views, in Proc. 5th ACM SIGAST-SIGMOD Symp. on Principles of DBS, Cambridge, MA, March 24–26, 1986, pp. 148–159.

    Google Scholar 

  4. Y. Sagiv, "A characterization of globally consistent databases and their correct access paths", ACM Trans. on DBS, 8, 2, June 1983, pp. 266–286.

    Google Scholar 

  5. L.A. Tenenbaum, "Structurization of relational description of systems" (preprint), Institute of Control Sciences, Moscow, 1986.

    Google Scholar 

  6. D. Maier, "The theory relational databases." Computer Science Press. Rockvill (Maryland), 1983.

    Google Scholar 

  7. R. Faigin, "Degrees of acyclicity for hypergraphs and relational database schemes", J. ACM, 30, 3, July 1983, pp. 514–550.

    Google Scholar 

  8. M. Gyssens and J. Paredans, "On the decomposition of join dependencies", Advances in Computing Research, 3, 1986, pp. 69–106.

    Google Scholar 

  9. A.D'Atri, M.Moscarini, "Acyclic hypergraphs: their recognition and top-down vs bottom-up generation", IASI-CNR Rep. N 29, Rome, Jan. 1982.

    Google Scholar 

  10. C. Beeri, R. Faigin, D. Maier, M. Yannakakis, "On the desirability of acyclic database schemes", J. ACM, 30, 3, July 1983, pp. 479–513.

    Google Scholar 

  11. G.Ausiello, A.D'Atri, M.Moscarini, "On the existence of acyclic views in a database scheme", IASI-CNR Rep. N 86, Rome, May 1984.

    Google Scholar 

  12. J. Biscup, H. Brüggemann, "Towards designing acyclic database schemes", Advances in database theory, 2, (Edd. H Gallaire, J. Minker, J. Nicolas), Plenum Press, N.Y.-London, 1984, pp. 3–25.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control Sciences, Profsoyuznaya 65, 117806, Moscow, USSR

    Lev A. Tenenbaum

Authors
  1. Lev A. Tenenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

János Demetrovics Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tenenbaum, L.A. (1989). Blocks and projections' synthesis in relational databases. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-51251-9_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51251-6

  • Online ISBN: 978-3-540-46182-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation