Linguistic approach to database theory: DDL-s for hierarchical model

https://doi.org/10.1016/0306-4379(78)90003-0Get rights and content

Abstract

In this paper a new approach to database systems based on the mathematical theory of linguistics is presented. It is assumed that any content of a database is a string of symbols. Then the expression of a data description language (DDL) can be considered a grammar which defines the set of strings; each of them may be the real content of database. Two types of DDLs are defined: a regular language which corresponds to the class of regular expressions in the theory of finite automata, and context-free language which corresponds to the class of context-free grammars. Some aspects of computer implementation of the above theoretical concepts are presented.

References (13)

  • G.L. Wolfendale

    Data description languages. Data base management

  • S. Liu et al.

    A record oriented, grammar driven data translation model

  • O.J. Dahl et al.

    Structured Programming

    (1972)
  • D.E. Knuth
  • W.M. Turski

    Data Structures

    (1972)
  • A. Blaser et al.

    Data Base Research: A Survey. Data Base Systems

There are more references available in the full text version of this article.

Cited by (0)

View full text