Search results

1 – 2 of 2
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 1 May 1999

E.J. Yannakoudakis1, C.X. Tsionos and C.A. Kapetis

This paper describes research work carried out with the aim to investigate dynamically evolving database environments and corresponding schemata, allowing storage and manipulation…

331

Abstract

This paper describes research work carried out with the aim to investigate dynamically evolving database environments and corresponding schemata, allowing storage and manipulation of variable length data, a variable number of fields per record, variable length records, manipulation of authority records and links between records and fields, and dynamically defined objects (relations in the traditional sense). The paper proposes a new framework for the definition of a unified schema that eliminates completely the need for reorganisation at both logical and internal levels. Retrieval of data is optimised through self‐contained storage chunks that also vary dynamically.

Details

Journal of Documentation, vol. 55 no. 2
Type: Research Article
ISSN: 0022-0418

Keywords

Access Restricted. View access options
Article
Publication date: 4 November 2014

Nikitas N. Karanikolas and Michael Vassilakopoulos

The purpose of this paper is to compare the use of two Object-Relational models against the use of a post-Relational model for a realistic application. Although real-world…

427

Abstract

Purpose

The purpose of this paper is to compare the use of two Object-Relational models against the use of a post-Relational model for a realistic application. Although real-world applications, in most cases, can be adequately modeled by the Entity-Relationship (ER) model, the transformation to the popular Relational model alters the representation of structures common in reality, like multi-valued and composite fields. Alternative database models have been developed to overcome these shortcomings.

Design/methodology/approach

Based on the ER model of a medical application, this paper compares the information representation, manipulation and enforcement of integrity constraints through PostgreSQL and Oracle, against the use of a post-Relational model composed of the Conceptual Universal Database Language (CUDL) and the Conceptual Universal Database Language Abstraction Level (CAL).

Findings

The CAL/CUDL pair, although more periphrastic for data definition, is simpler for data insertions, does not require the use of procedural code for data updates, produces clearer output for retrieval of attributes, can accomplish retrieval of rows based on conditions that address composite data with declarative statements and supports data validation for relationships between composite data without the need for procedural code.

Research limitations/implications

To verify, in practice, the conclusions of the paper, complete implementation of a CAL/CUDL system is needed.

Practical implications

The use of the CAL/CUDL pair would advance the productivity of database application development.

Originality/value

This paper highlights the properties of realistic database-applications modelling and management that are desirable by developers and shows that these properties are better satisfied by the CAL/CUDL pair.

Details

Journal of Systems and Information Technology, vol. 16 no. 4
Type: Research Article
ISSN: 1328-7265

Keywords

1 – 2 of 2
Per page
102050