Pointer MechanismsEngineeringData ScienceData ArchitectureDatabase SystemDatabase SupportLogical ViewComputer EngineeringComputer ArchitectureData IntegrationParallel ProgrammingComputer ScienceStorage StructureParallel ComputingDatabase TechnologyData ManagementSystem SoftwareSoftware Complexities
Recent concepts in data base management systems (DBMS) necessitate making the logical view and the physical representation of data distinct from each other. Currently, this requirement has to be realized in the environment of conventional Von Neumann architecture. This creates the need for several levels of indirection for mapping one structure into the other. Also, efficient search mechanisms are needed to handle large data bases within concurrent processing and on-line response limits. The implementation of these requirements results in software complexities and inefficiencies in the following way. Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data. These pointers are extra data requiring extensive overhead in storage, access time, and maintenance.
11
A relational model of data for large shared data banks
E. F. Codd · Communications of the ACM · 1983 · 4.8K citations
Donald D. Chamberlin, Raymond F. Boyce · 1976 · 576 citations
A data base sublanguage founded on the relational calculus
E. F. Codd · 1971 · 372 citations
Specifying queries as relational expressions
Raymond F. Boyce, Donald D. Chamberlin, William F. King et al. · Communications of the ACM · 1975 · 100 citations · Full text