Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

A file organization suitable for relational database operations

  • Conference paper
  • First Online:
Mathematical Studies of Information Processing

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

Abstract

In this paper, a new access method called Relational Inverted Structure(RIS) supporting relational database operations efficiently is introduced.

The RIS design is aimed at increasing the efficiency of relational operations and balancing the required response times of relational operations on any attribute. Hashed attribute values are used to decrease the number of accesses to a relation by eliminating tuples which have obviously been proved not to be contained in the answer.

The concept of functional dependency is used to increase the efficiency of operations performed on RIS files. For an update of an individual tuple, RIS files endow views with the check capability of the update viability.

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.

Similar content being viewed by others

References

  1. Chamberlin, D.D., "Relational Data Base Management Systems", IBM Res. Rep., RJ1729, Feb. 1976

    Google Scholar 

  2. Chamberlin, D.D., Gray, J.N. and Traiger, I.L., "Views, Authorization, and Locking in a Relational Data Base System", Proc. AFIPS 1975 National Computer Conf., pp.425–430, May 1975

    Google Scholar 

  3. Codd, E.F., "Recent Investigations into Relational Data Base Systems", Proc. IFIP Congress 1974, pp.1017–1021, Aug. 1974

    Google Scholar 

  4. Codd, E.F., "Further Normalization of the Data Base Relational Model", Courant Compt. Sci. Symposia, pp.34–64, May 1971.

    Google Scholar 

  5. Astrahan, N.M., et al., "System R: Relational Approach to Database Management", ACM Trans. Database Systems, vol.1, no.2, June 1976.

    Google Scholar 

  6. Haerder, T., "An Implementation Technique for a Generalized Access Path Structure", IBM Res. Rep., RJ1837, Oct. 1976

    Google Scholar 

  7. Date, C.J., "An Introduction to Database Systems", 2nd Ed. Addision Wesley, 1977

    Google Scholar 

Download references

Author information

Author notes

  1. Katsumi Tanaka

    Present address: College of Liberal Arts, Kobe University, 657, Kobe, Japan

Authors and Affiliations

  1. Department of Information Science, Kyoto University, 606, Sakyo, Kyoto, Japan

    Katsumi Tanaka, Chung Le Viet, Yahiko Kambayashi & Shuzo Yajima

Authors
  1. Katsumi Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung Le Viet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yahiko Kambayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shuzo Yajima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tanaka, K., Le Viet, C., Kambayashi, Y., Yajima, S. (1979). A file organization suitable for relational database operations. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation