rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Extension to a set-theoretic data structure sub-language
  name:
    name part: Grewe, Charles John.
    role:
      role term: creator
  name:
    name part: Anderson, Robert J.
    role:
      role term: degree committee member.
  name:
    name part: Elliott, Roger W.
    role:
      role term: degree supervisor.
  name:
    name part: Pooch, Udo W.
    role:
      role term: degree committee member.
  name:
    name part: Rice, George H.
    role:
      role term: degree committee member.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: theses
  genre: Academic theses
  origin info:
    place:
      place term: txu
    date issued: 1973
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: 272 leaves
  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.
  note: Ph. D. in Computing Science Texas A & M University
  subject:
    topic: Major computing science
  identifier: http://proxy.library.tamu.edu/login
  identifier: https://hdl.handle.net/1969.1/DISSERTATIONS-156304
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: https://hdl.handle.net/1969.1/DISSERTATIONS-156304
  record info:
    record content source: TXA
    record creation date: 800122
    record change date: 20220103135114.0
    record identifier: in00000143838
    language of cataloging:
      language term: eng