scispace - formally typeset
Search or ask a question

Showing papers on "Data warehouse published in 1978"


Proceedings ArticleDOI
31 May 1978
TL;DR: The semantic data model (SDM) has been designed as a natural application modelling mechanism that can capture and express the structure of an application environment that corresponds to the principal intensional structures naturally occurring in contemporary data base applications.
Abstract: Conventional data models are not satisfactory for modelling data base application systems. The features that they provide are too low level and representational to allow the semantics of a data base to be directly expressed in the schema. The semantic data model (SDM) has been designed as a natural application modelling mechanism that can capture and express the structure of an application environment. The features of the SDM correspond to the principal intensional structures naturally occurring in contemporary data base applications. Furthermore, facilities for expressing derived (redundant) information are an essential part of the SDM; derived information is as prominent in an SDM schema as is primitive data. The SDM is designed to enhance the effectiveness and usability of computerized data bases. It can serve as a formal specification and documentation mechanism for a data base, can support a variety of powerful user interface facilities, and can be used as a tool in the data base design process.

165 citations


01 Jan 1978
TL;DR: This data management system was based upon studies of data management problems currently being handled through explicit programming and is explicitly tailored to the needs of engineering and scientific computing.
Abstract: Data elements and relationship definition capabilities for this data management system are explicitly tailored to the needs of engineering and scientific computing. System design was based upon studies of data management problems currently being handled through explicit programming. The system-defined data element types include real scalar numbers, vectors, arrays and special classes of arrays such as sparse arrays and triangular arrays. The data model is hierarchical (tree structured). Multiple views of data are provided at two levels. Subschemas provide multiple structural views of the total data base and multiple mappings for individual record types are supported through the use of a REDEFINES capability. The data definition language and the data manipulation language are designed as extensions to FORTRAN. Examples of the coding of real problems taken from existing practice in the data definition language and the data manipulation language are given.

6 citations


01 Jan 1978
TL;DR: The final step in this research is to evaluate proposed hardware that could be utilized to implement a data dictionary and part of a data directory by comparing its processing times with the processing times for a conventional sequential computer.
Abstract: : This research is concerned with the development of a mathematical base that can be utilized to model data base management systems from the user level down to the bit level and to develop and evaluate proposed hardware that could be utilized to implement a data dictionary and part of a data directory The mathematical modeling development is accomplished through set theory and the addition of order to sets This mathematical base is used to define in detail some of the functions that must be performed in Data Base Management (DBM) by operating on the following four levels of data: (1) the user computer interface (Reserved Word); (2) the attribute and file or relationship (F/R) names (Data Name); (3) the modifiers of the attribute and F/R names (Data Descriptors); and (4) the occurrences of the attributes and F/Rs (Data occurrence) Hardware implementation designs are then considered for a subset of these functions and data levels The data levels considered are the Data Name and Data Descriptor Levels Specifically, hardware designs are developed for the data and functions performed by a Data Dictionary and parts of a Data Directory Given the proposed hardware implementation the final step in this research is to evaluate this hardware by comparing its processing times with the processing times for a conventional sequential computer

5 citations