File organizations with shared overflow blocks for variable length objects

No abstract is available for this paper.

• Publication year

  1992

• Venue

  Information Systems

• Publication date

  1992-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/0306-4379(92)90028-L
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithms for a hashed file with variable-length records

  1992cited by this paper
• How spacey can they get? Space overhead for storage and indexing with object-oriented databases

  1991cited by this paper
• Analysis for the end of block wasted space

  1990cited by this paper
• Analysis of Overflow Handling for Variable Length Records

  1989cited by this paper
• Iris: An Object-Oriented Database Management System

  1989cited by this paper
• External hashing with limited internal storage

  1988cited by this paper
• Dynamic hashing schemes

  1988cited by this paper
• Data model issues for object-oriented applications

  1987cited by this paper
• File organization for database design

  1987cited by this paper
• Dynamic file structure for partial match retrieval based on overflow bucket sharing

  1986cited by this paper
• Implications of certain assumptions in database performance evauation

  1984cited by this paper
• Estimating block transfers and join sizes

  1983cited by this paper
• Design of Database Structures

  1982cited by this paper
• Optimal file designs and reorganization points

  1982cited by this paper
• Analysis of index-sequential files with overflow chaining

  1981cited by this paper
• On the distribution of wasted space at the end of file blocks

  1980cited by this paper
• Dynamic hashing

  1978cited by this paper
• Queueing Systems - Vol. 1: Theory

  1975cited by this paper
• Ordered Hash Tables

  1974cited by this paper

• Analysis for the end of block wasted space

  1990cites this paper