A data definition and mapping language
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
ACM '67 Proceedings of the 1967 22nd national conference
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
Interactive support for non-programmers: The relational and network approaches
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
On the equivalences of data based systems
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
The relational and network approaches: Comparison of the application programming interfaces
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
Evolution of Data-Base Management Systems
ACM Computing Surveys (CSUR)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
Data architecture and data model considerations
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
| Hi-index | 0.00 |
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.