Skip to main content
SpringerLink
Log in

The Nested Universal Relation Database Model

  • Book
  • © 1992

Overview

Editors:
  1. M. Levene
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 595)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-9

  3. The underlying database models

    Pages 11-33

  4. The null extended nested relational model

    Pages 35-75

  5. Null extended data dependencies and the extended chase

    Pages 77-107

  6. A universal relation model for a nested database

    Pages 109-135

  7. A universal relation model for a single nested relation

    Pages 137-157

  8. Concluding remarks and ongoing research

    Pages 159-161

  9. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

This monograph describes a method of data modelling whose basic aim is to make databases easier to use by providing them with logical data independence. To achieve this, the nested UR (universal relation) model is defined by extending the classical UR model to nested relations. Nested relations generalize flat relations and allow hierarchically structured objects to be modelled directly, whereas the classical UR model allows the user to view the database as if it were composed of a single flat relation. The author presents a comprehensive formalisation of the nested relational model, which incorporated null values into the model. Functional data dependencies and the classical notion of lossless decomposition are extended to nested relations and an extended chase procedure is defined to test the satisfaction of the data dependencies. The nested UR model is defined, and the classical UR model is shown to be a special case of the nested model.This implies that an UR interface canbe implemented by using the nested UR model, thus gaining the full advantages of nested relations over flat relations.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation