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

摘要

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.