The Nested Universal Relation Database Model
Mark Levene
The Nested Universal Relation Database Model
Mark Levene
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This monograph describes a method of data modelling whosebasic aim is to make databases easier to use by providingthem with logical data independence. To achieve this, thenested UR (universal relation) model is defined by extendingthe classical UR model to nested relations. Nested relationsgeneralize flat relations and allow hierarchicallystructured objects to be modelled directly, whereas theclassical UR model allows the user to view the database asif it were composed of a single flat relation. The authorpresents a comprehensive formalisation of the nestedrelational model, which incorporated null values into themodel. Functional data dependencies and the classical notionof lossless decomposition are extended to nested relationsand an extended chase procedure is defined to test thesatisfaction of the data dependencies. The nested UR modelis defined, and the classical UR model is shown to be aspecial case of the nested model. This implies that an URinterface canbe implemented by using the nested UR model,thus gaining the full advantages of nested relations overflat relations.
This item is not currently in-stock. It can be ordered online and is expected to ship in 7-14 days
Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.
Sign in or become a Readings Member to add this title to a wishlist.