A storage system for complex objects

  • Authors:

  • U. Deppisch;H.-B. Paul;H.-J. Schek

  • Affiliations:

  • TH Darmstadt, FB Informatik, FG DVS I Alexanderstr. 24, D-6100 Darmstadt, West Germany;TH Darmstadt, FB Informatik, FG DVS I Alexanderstr. 24, D-6100 Darmstadt, West Germany;TH Darmstadt, FB Informatik, FG DVS I Alexanderstr. 24, D-6100 Darmstadt, West Germany

  • Venue:
  • OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

Complex objects are required in many new applications of databases. A common characteristic feature is that objects use other (sub-) objects for their description. Consequently retrieval or extraction of complex objects may include some or all of their subobjects which - in turn - may have subobjects to be extracted too. Accordingly a storage system is described which was designed and implemented with the objective to provide this set orientation: Relations with relation-valued attributes are used as model for internally stored objects; its inherent property is set orientation.The main focus of this paper is the description of storage structures which allow to preserve this set orientation down to the page layer. Its key concept consists in the introduction of an address space for every internally stored object which - usually - can be obtained by two set oriented page requests. The proposed internal addressing scheme and clustering of “directory headers” is an attempt to keep the overall number of page accesses small.