Batch insertion for tree structured file organizations—improving differential database representation

https://doi.org/10.1016/0306-4379(86)90005-0Get rights and content

Abstract

This paper presents an algorithm to perform batch insertions into tree structured files. The efficiency of the algorithm is formally analyzed. To demonstrate the usefulness of the algorithm, optimum batch insertion points are determined in one particular example. The example demonstrates that batch operations for tree structured files may be used to achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.

References (16)

  • V.J. Kollias et al.

    Database Maintenance Efficiency Using Differential Files

    Inf. Syst. (GB)

    (1980)
  • D.G. Severence et al.

    Differential Files: Their Application to the Maintenance of Large Databases

    ACM Trans. Database Syst.

    (1976)
  • R.A. Lorie

    Physical Integrity in a Large Segmented Database

    ACM Trans. Database Syst.

    (1977)
  • B.H. Bloom

    Space/time Trade-offs in Hash Coding with Allowable Errors

    Commun. ACM

    (1970)
  • J.K. Mullin

    Change Area B-trees: A Technique to Aid Error Recovery

    Computer Journal

    (1981)
  • H. Aghili et al.

    A Practical Guide to the Design of Differential Files for Recovery of Online Databases

    ACM Trans. Database Syst.

    (1982)
  • G.M. Lohman et al.

    Optimal Policy for Batch Operations: Backup, Checkpointing, Reorganization, and Updating

    ACM Trans. Database Syst.

    (1977)
  • R. Bayer et al.

    Organization and Maintenance of Large Ordered Indexes

    Acta Informatica

    (1972)
There are more references available in the full text version of this article.

Cited by (0)

View full text