A file organization suitable for relational database operations
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.
Keywordsrelational database physical data structure efficient query processing functional dependency view handling hash method unsuccessful search
Unable to display preview. Download preview PDF.
- Chamberlin, D.D., "Relational Data Base Management Systems", IBM Res. Rep., RJ1729, Feb. 1976Google Scholar
- 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 1975Google Scholar
- Codd, E.F., "Recent Investigations into Relational Data Base Systems", Proc. IFIP Congress 1974, pp.1017–1021, Aug. 1974Google Scholar
- Codd, E.F., "Further Normalization of the Data Base Relational Model", Courant Compt. Sci. Symposia, pp.34–64, May 1971.Google Scholar
- Astrahan, N.M., et al., "System R: Relational Approach to Database Management", ACM Trans. Database Systems, vol.1, no.2, June 1976.Google Scholar
- Haerder, T., "An Implementation Technique for a Generalized Access Path Structure", IBM Res. Rep., RJ1837, Oct. 1976Google Scholar
- Date, C.J., "An Introduction to Database Systems", 2nd Ed. Addision Wesley, 1977Google Scholar