Abstract
The family of sets is proposed as the basic structure for modeling data. A family is created by indexing one set of objects by another to represent a directed binary association between two sets. Familial models are shown to have a number of distinct advantages in supporting diverse user views through a hierarchy of abstractions and a variety of derived data, and in describing themselves and other data models through metamodels. An algebra of families is introduced to provide a data definition, maintenance and processing language that is minimal, intuitive, algebraic and theoretically sound. The language is extended to a specification language for database application systems, largely eliminating the need for embedding database constructs into procedural programming languages.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
D. L. Childs, Feasibility of a Set Theoretical Data Structure—A General Structure Based on a Reconstituted Definition of Relation. Proc. IFIP Congress, pp. 162–172 (1968).
E. F. Codd, A Relational Model of Data for Large Shared Data Banks,Comm. ACM 13(6):377–387 (1970).
J. D. Ullman, Principles of Database Systems. Computer Science Press, Maryland (1980).
J. R. Abrial, Data Semantics. InDatabase Management, J. W. Klimbie and K. L. Koffeman (eds.), North Holland Publising Co., Amsterdam (1974).
G. Bracchi, P. Paolini, and G. Pelagatti, Binary Logical Associations in Data Modeling. InModeling in Database Management Systems, G. M. Nijssen (ed.), North Holland Publishing Co., Amsterdam (1976).
M. E. Senko, DIAM as a Detailed Example of the ANSI/SPARC Architecture. InModeling in Database Management Systems, G. M. Nijssen (ed.), North Holland Publishing Co., Amsterdam (1976).
D. W. Shipman, The Functional Data Model and the Data Language DAPLEX,ACM Transactions in Database Syst. 6(1):140–173 (March 1981).
ANSI/X3/SPARC Study Group on Database Management Systems. Interim report (February 1975); also FDT, ACM-SIGMOD,7(1):1–26 (1975).
G. M. Nijssen, A Gross Architecture for the Next Generation Database Management Systems. InModeling Database Management Systems, Proc. IFIP TC2 Working Conference, Freuderstadt, G. M. Nijssen (ed.), North Holland Publishing Co., Amsterdam (1976).
W. Kent, Data and Reality, North Holland Publishing Co., Amsterdam (1978).
W. Kent, Limitations of Record-Based Information Models,ACM Transactions on Database Systems 4(1):107–131 (1979).
E. F. Codd, Relational Completeness of Database Sublanguages. Courant Computer Science Symposia, Vol. 6, inDatabase Systems, R. Rustin (ed.), Prentice Hall, Englewood Cliffs, New Jersey (1972).
R. F. Boyce, D. D. Chamberlin, F. W. King, and M. M. Hammer, III, Specifying Queries as Relational Expressions: The SQUARE Data Sublanguage,Comm. ACM 18(11):521–628 (1975).
M. E. Senko, A Query-Maintenance Language for the Data Independent Accessing Model II,Inform. Syst. 5(4):257–272 (1980).
M. M. Zloof, Query by Example: A Database Language,IBM Systems Journal 16(4):324–343 (1977).
D. D. Chamberlin and R. F. Boyce, SEQUEL: A Structured English Query Language, Proc. Conf. on Management of Data (1974).
J. M. Smith and D. C. P. Smith, Database Abstractions: Aggregation and Generalization,ACM Transactions on Database Syst. 2(2):105–133 (1977).
M. M. Astrahanet al., System R: Relational Approach to Database Management,ACM Transactions on Database Systems 1(2):97–137 (June 1976).
M. Stonebrakeret al., The Design and Implementation of INGRES,A CM Transactions on Database Syst. 1(3):189–222 (September 1976).
E. F. Codd, Extending the Database Relational Model to Capture More Meaning,ACM Transaction on Database Systems,4(4):397–434 (1979).
R. Bosaket al., An Information Algebra,Comm. ACM 5(4):190–204 (April 1962).
M. Hammeret al., A Very High Level Language for Data Processing Applications,Comm. ACM 20(11):832–840 (November 1977).
L. Orman, An Array Theoretic Specification Environment for the Design of Decision Support Systems,Policy Anal. and Infor. Syst. 6(4):373–391 (1982).
L. Orman, A Familial Specification Language for Database Application Systems,Computer Languages,8(3):113–124 (1983).
C. Berge, Topological Spaces, MacMillan Co., New York (1963).
P. R. Halmos, Naive Set Theory, Van Nostrand Publishing Co., New York (1960).
P. A. V. Hall, J. Owlett, and S. J. P. Todd, Relations and Entities. InModeling Database Management Systems, G. M. Nijssen (ed.), North Holland (1976).
U. Dayal and P. H. Bernstein, On the Updatability of the Relational Views. Proc. 4th Int. Conf. Very Large Database, pp. 368–377, Berlin (September 1978).
E. Allman, M. R. Stonebraker, and G. Held, Embedding a Relational Data Sublanguage in a General Purpose Programming Language,ACM SIGPLAN Notices 11:25–35 (March 1976).
D. D. Chamberlinet al., SEQUEL 2: A Unified Approach to Data Definition, Manipulation and Control,IBM J. of Res. and Develop. 20(6):560–575 (November 1976).
L. Orman, An Information Base for Procedure Independent Design of Information Systems, Proc. AFIPS National Computer Conference, pp. 817–821 (1980).
J. W. Schmidt, Some High Level Constructs for the Data of Type Relation,ACM Transactions on Database Syst. 2(3):247–261 (1977).
M. R. Stonebraker and L. A. Rowe, Observations on Data Manipulation Languages and Their Embedding in General Purpose Programming Languages, Proc. Very Large Databases (1977).
C. J. Premier and A. R. Lawrence, Programming Languages for Relational Database Systems, Proc. AFIPS National Computer Conference, pp. 849–855 (1978).
S. L. Alter, A Study of Computer-aided Decision Making in Organizations, Ph.D. Dissertation, Massachusetts Institute of Technology (June 1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Orman, L. Familial model of data. International Journal of Computer and Information Sciences 13, 149–175 (1984). https://doi.org/10.1007/BF00979870
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00979870