Skip to main content

On the Theory of Relational Data Bases with Incomplete Information

  • Conference paper
East/West Database Workshop

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 36 Accesses

Abstract

In many applications the information stored in relational databases is incomplete. Database designers and users quite often face difficulties due to the inadequate consideration of incomplete information. In this paper we present a theory for the treatment of incomplete information in relational databases using L-relations and algebras of L-relations. We show that the main results of the theory of relational databases like the theory of functional and mulivalued dependencies remain valid for L-relations. Furthermore, it is shown that in order to solve the decomposition problem for L-relations we have to investigate systems of equations with coefficients in L which express specific properties of L-relations.

The research was supported by the Russian Basic Research Foundation, grant number 94-01-01479-a

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.A.Babushkin. Heyting categories with involution and their applications. Ph.D.Thesis.-Moscow State Pedagog.Inst., 1988.

    Google Scholar 

  2. C.Beeri, M.Y.Vardi. Formal systems for tuple and equality generating dependencies. SIAM J. Comput., 1984, v. 13, NI, pp.76–98.

    Google Scholar 

  3. N.D.Belnap. How a computer should think. In: Contemporary aspects of philosophy. Proc. of the Oxford Int. Symposium, 1976.

    Google Scholar 

  4. E.F.Codd. Extending the Database Relational Model to Capture More Meaning. ACM Trans on Datebase Systems, 1979, v.4, N4, pp. 397–434.

    Google Scholar 

  5. T. Imielinski, W. Lipski. The relational model of data and cylinric algebras. J. of Comp. and Syst. Sci., 1984, v. 28, pp. 80–102.

    Article  MathSciNet  MATH  Google Scholar 

  6. D.Meier. The theory of relational databases. Comp. Sci. Press. 1983.

    Google Scholar 

  7. M.Sh.Tsalenko. Modeling semantics in data bases. Moscow, Nauka, 1989 (in Russian).

    Google Scholar 

  8. M.Sh.Tsalenko. Database theory in Russia (1979–1991)(an overview). Lect. Notes in Comp. Sci., 1992, v. 646, pp. 50–70.

    Google Scholar 

  9. M.Sh.Tsalenko. Functional and multivalued dependencies for L-relations. ADBIS’94. Proc. of Int. Conf., Moscow, 1994, pp. 228–234.

    Google Scholar 

  10. L.A.Zadeh. The concept of a linguistic variable and its application to approximate reasoning. N.Y., Elsevier Publ. Comp., 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsalenko, M.S. (1995). On the Theory of Relational Data Bases with Incomplete Information. In: Eder, J., Kalinichenko, L.A. (eds) East/West Database Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3577-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3577-7_3

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19946-5

  • Online ISBN: 978-1-4471-3577-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics