A technique for implementing a set processor
- 1 March 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 8 (2) , 86-94
- https://doi.org/10.1145/984344.807126
Abstract
Extended set theory is an effective method for describing the complex data structures needed to support large-scale data base applications. This paper describes the incorporation of the salient concepts of extended set theory into a general tool for the design and implementation of large-scale database systems. This tool is called a set processor. This implementation is based on the representation of sets of positive integers as bit strings and the application of the Cauchy/Cantor Diagonal Method.Keywords
This publication has 13 references indexed in Scilit:
- Information systems: Records, relations, sets, entities, and thingsInformation Systems, 1975
- The relational and network approachesPublished by Association for Computing Machinery (ACM) ,1975
- Interactive support for non-programmersPublished by Association for Computing Machinery (ACM) ,1975
- The data structure set modelPublished by Association for Computing Machinery (ACM) ,1975
- A data definition and mapping languageCommunications of the ACM, 1973
- Data structures and accessing in data-base systems, I: Evolution of information systemsIBM Systems Journal, 1973
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- FEASIBILITY OF A SET-THEORETIC DATA STRUCTURE. A GENERAL STRUCTURE BASED ON A RECONSTITUTED DEFINITION OF RELATIONPublished by Defense Technical Information Center (DTIC) ,1968
- DESCRIPTION OF A SET-THEORETIC DATA STRUCTUREPublished by Defense Technical Information Center (DTIC) ,1968
- Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)Published by Association for Computing Machinery (ACM) ,1967