IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Technical Journals

Special report: Celebrating 50 years of the IBM Journals
All topics > Storage Systems and Databases >

Storage and access in relational data bases

Award plaque by M. W. Blasgen
and K. P. Eswaran

A model of storage and access to a relational data base is presented. Using this model, four techniques for evaluating a general relational query that involves the operations of projection, restriction, and join are compared on the basis of cost of accessing secondary storage. The techniques are compared numerically and analytically for various values of important parameters. Results indicate that physical clustering of logically adjacent items is a critical performance parameter. In the absence of such clustering, methods that depend on sorting the records themselves seem to be the algorithm of choice.

Originally published:

IBM Systems Journal, Volume 16, Issue 4, pp. 363-377 (1977).

Significance:

Modern commercial computer applications often require rapid access to large amounts of data in the form of databases. Databases not only represent a crucial infrastructure for computer applications, but they also process the transactions and exchanges that drive the economies of numerous countries. Many of today's markets rely on relational databases based on a model proposed in the late 1960s and early 1970s. This model permits a high degree of data independence by providing a logical view of the database that avoids details of the physical storage.

This very highly cited IBM Systems Journal paper discusses a model of storage and access to a relational database. In particular, it describes methods for evaluating the performance of relational queries. When this paper was written, although several relational database systems had been implemented, little information had appeared on the performance of such systems. In the early 1970s, IBM scientist Ted Codd published a paper introducing the concept of relational databases that called for information stored within a computer to be cast in the form of relationships. Today, most database structures are based on the IBM concept of relational databases.

Comments:

See “The Rise of Relational Databases,” a chapter in the book Funding a Revolution: Government Support for Computing Research by National Research Council.


    About IBMPrivacyContact