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 / F. Cacace, P. Samarati, L. Tanca. - In: COMPUTING. - ISSN 0010-485X. - 55:1(1995), pp. 55-73.

Set-Oriented Retrieval of Complex Objects in Inheritance Hierarchies

P. Samarati
Secondo
;
1995

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.
Settore INF/01 - Informatica
1995
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/180050
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact