Skip to main content
SpringerLink
Log in

Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases

  • Session 2B: Database
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

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

Included in the following conference series:

  • 147 Accesses

Abstract

Commonly used methods to deal with the safety issue in relational databases are based on “placing constraint of finiteness” on relational calculus. This paper describes how safety can be achieved using a novel approach. A new representation is created to denote the relations defined by relational calculus. An algorithm which can symbolically handle infinite relations is designed to efficiently compute all these relations. Therefore the constraint of finiteness on relational calculus can be removed.

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. C. Beeri, S. Naqvi, R. Ramakrishnan, O. shmueli, and S. Tsur: Sets and negation in a logic database language(LDL1). Proc. Sixth ACM Symp. on Principles of Database Systems, pp. 21–37, 1987

    Google Scholar 

  2. A. V. Gelder and W. R. Topor: Safety and correct translation of relational calculus formulas. Proc. sixth ACM Symp. on Principles of Database Systems, pp.313–327, 1987

    Google Scholar 

  3. G. M. Kuper G. M.: Logic programming with sets. Proc. sixth ACM Symp. on Principles of Database Systems, pp.11–20, 1987

    Google Scholar 

  4. R. Ramakrishnan, F. Bancilhon, and A. Sillberschatz: Safety of recursive Horn clauses with infinite relations. Proc. sixth ACM Symp. on Principles of Database Systems, pp. 328–339, 1987

    Google Scholar 

  5. O. Shmuel: Decidability and Expressiveness aspects of logic queries. Proc. sixth ACM Symp. on Principles of Database Systems, pp. 237–249

    Google Scholar 

  6. J. D. Ullmman: Database and Knowledge-base Systems vol. 1, Classical Database Systems, Computer-Science Press, 1988

    Google Scholar 

  7. C. Zaniolo: Safety and Compilation of Nonrecursive Horn ClausesProc. First Intl. Conf. on Expert Database Systems, BenjaminCummings, Menlo Park, CA, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Ruogu Zhang

Authors
  1. Ruogu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, R. (1995). Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030823

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation