NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Extension to a set-theoretic data structure sub-language
dc.contributor.advisor | Elliott, Roger W. | |
dc.creator | Grewe, Charles John | |
dc.date.accessioned | 2020-01-08T17:22:59Z | |
dc.date.available | 2020-01-08T17:22:59Z | |
dc.date.created | 1973 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-156304 | |
dc.description.abstract | Generalized Data Base Management Systems are a product of current requirements to give users easy and direct access to data that has been stored in large scale data banks. There is a great need of a theoretical basis for these systems that will scientifically support their practical implementation. This dissertation deals with the concept of a relational model of data for large shared data banks. The research supports the previous work on relational models of data and extends set theoretic principles to include new and more powerful operations in the mathematical concepts of a relational algebra. The fundamental primitives of the relational algebra and the extensions resulting from this research were applied to the specifications, design, and implementation for an experimental Relational Algebra Sub-Language (REAL). This language was implemented on the NOVA 1200 minicomputer as a model information storage and retrieval system. The implementation of this system demonstrated the following: a. An information storage and retrieval language can be developed based on derived mathematical principles from the relational algebra. b. Programming a relational algebra language into a usable, interactive information storage and retrieval system is feasible. c. the relational model of data can be applied on a small scale computer system. d. The theoretical consideration discussed and expanded by this research have practical consequences. | en |
dc.format.extent | 272 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject.classification | 1973 Dissertation G841 | |
dc.title | Extension to a set-theoretic data structure sub-language | en |
dc.type | Thesis | en |
thesis.degree.discipline | Computing Science | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
thesis.degree.level | Doctoral | en |
thesis.degree.level | Doctorial | en |
dc.contributor.committeeMember | Anderson, Robert J. | |
dc.contributor.committeeMember | Pooch, Udo W. | |
dc.contributor.committeeMember | Rice, George H. | |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.