Very Large Data Bases · 1987 · 159 citations · 24 references
ComputingComputer ScienceComputer SystemsDatabasesParallel ComputingProgramming LanguagesData ParallelismData-flow AnalysisDatabase ManagementParallel Computer ArchitectureParallel Data StructuresParallel DatabasesAbstract Data TypesConstructorsObject IdentityObjectsOperatorsParallel Database ArchitecturesParallel Database SystemsType Constructors
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its programs (defined in terms of operators and predicates). The primary features of the language are (i) the support of complex objects with built-in notion of object identity; (ii) an abstract data type capability; (iii) a persistent object space; and (iv) the efficient support of iteration, conditionals, and set operations. FAD is functional and uses low level operators and operator constructors. This provides for the opportunity of dataflow execution in a parallel architecture. FAD has been successfully implemented in (i) an interpreter working on a main memory database and (ii) integrated in a prototype of a database machine.
24
A relational model of data for large shared data banks
E. F. Codd · Communications of the ACM · 1983 · 4.8K citations
The relational model with relation-valued attributes
Hans‐Jörg Schek, Marc H. Scholl · Information Systems · 1986 · 474 citations
Setrag Khoshafian, George P. Copeland · ACM SIGPLAN Notices · 1986 · 472 citations
An Approach to Persistent Programming
Malcolm P. Atkinson, Peter J. Bailey, Kenneth Chisholm et al. · The Computer Journal · 1983 · 416 citations · Full text