|
Preprints of the Keldysh Institute of Applied Mathematics, 1998, 054
(Mi ipmp1368)
|
|
|
|
A Deductive Language for Automatically Structured Data
E. L. Kitaev, M. I. Slepenkov
Abstract:
In this paper a model of automatically structured database is introduced, which is intended for representation of semistructured data. We describe a deductive language and corresponding formalism which are designed to support the presented model and to take into consideration the specific properties such as low quality of automatically generated scheme. The major advantage of the language is its similarity with structured deductive languages whereby structured programming methods and techniques (including programming of recursion) are preserved.
Citation:
E. L. Kitaev, M. I. Slepenkov, “A Deductive Language for Automatically Structured Data”, Keldysh Institute preprints, 1998, 054
Linking options:
https://www.mathnet.ru/eng/ipmp1368 https://www.mathnet.ru/eng/ipmp/y1998/p54
|
Statistics & downloads: |
Abstract page: | 75 | Full-text PDF : | 3 |
|