Implementing hierarchical data types within the relational model

Authors:
Kevin Wilkinson
Affiliations:
Department of Information Systems, Massey University, Private Box 756, Wellington, New Zealand
Venue:
Neural, Parallel & Scientific Computations - Special issue: Computing intelligence in management
Year:
2004

Citing 5
Cited 0

An introduction to database systems (7th ed.)

An introduction to database systems (7th ed.)
Information modeling and relational databases: from conceptual analysis to logical design

Information modeling and relational databases: from conceptual analysis to logical design
Foundation for Future Database Systems: The Third Manifesto

Foundation for Future Database Systems: The Third Manifesto
Database Systems: A Practical Approach to Design, Implementation, and Management

Database Systems: A Practical Approach to Design, Implementation, and Management
Database Management Systems

Database Management Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this chapter we address the question: What options are available within the relational model for implementing hierarchical data types? The special characteristics of these types are examined and the prospects for implementing them are assessed separately for both the current (SQL2) and proposed (SQL3) versions of the model. While the proposed version's user-defined types seem to provide a suitable mechanism, the current version leaves no option but to implement hierarchies as features of application programs rather than databases. The findings of an experimental implementation of a hierarchy are described and the requirements of a generalized solution for such implementations are specified. Strategies for accommodating a number of specialized tree structures within the generalized solution are suggested.