Many object oriented data models have been proposed in the past few years, and this field is one of the most promising for the development of new generation database systems. With complex data structures where an ISA hierarchy has been defined, the problem of efficiently storing and retrieving (a collection of) objects increases its relevance dramatically. This paper proposes efficient set-oriented algorithms for the storage and retrieval of complex objects in an inheritance hierarchy.
Set-Oriented retrieval of complex objects in inheritance hierarchies
TANCA, LETIZIA
1995-01-01
Abstract
Many object oriented data models have been proposed in the past few years, and this field is one of the most promising for the development of new generation database systems. With complex data structures where an ISA hierarchy has been defined, the problem of efficiently storing and retrieving (a collection of) objects increases its relevance dramatically. This paper proposes efficient set-oriented algorithms for the storage and retrieval of complex objects in an inheritance hierarchy.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.