Advances in the design of the BANG file

  • M. W. Freeston
Multidimensional Data
Part of the Lecture Notes in Computer Science book series (LNCS, volume 367)


A recent paper described a new kind of grid file — the BANG file — which, unlike previous grid file designs, has the important property that the directory never expands faster than the data, whatever the dimensionality of the file or the form of the data distribution. Experience with the first implementation of the BANG file has given new insights into its properties and behaviour, which have enabled significant improvements in performance to be obtained without compromising the conceptual simplicity of the original design:
  • •access to an individual tuple now always succeeds in a single pass down the directory tree, as with a B-tree;

  • •overflow or underflow of data or directory pages never leads to more page splits or merges than in a B-tree of the same directory depth;

  • •every direct representation of a sub-space of the data space is guaranteed to be a minimal representation — substantially improving the efficiency of range searches, partial match searches and joins.

The paper begins with a review of the original design in the light of its implementation. A detailed description is then given of the enhancements which have been found possible, with the theoretical foundations on which they depend. Finally, a selection of performance figures are given to demonstrate its characteristics.


Data Space Minimal Representation Block Region Directory Entry Logical Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [ABEL83]
    D.J. Abel, J.L. Smith A data structure and algorithm based on a linear key for a rectangle retrieval problem Computer Vision, Graphics and Image Processing 27,1,1983.Google Scholar
  2. [BURK83]
    W.A. Burkhard Interpolation-Based Index Maintenance Proc. ACM SIGMOD-SIGACT Symposium, 1983.Google Scholar
  3. [FREE87]
    M.W.Freeston The BANG file: a new kind of grid file Proc. ACM SIGMOD Conf., San Francisco, 1987.Google Scholar
  4. [HINR85]
    K.H. Hinrichs The grid file system: implementation and case studies of applications Doctoral Thesis Nr. 7734, ETH Zurich, 1985.Google Scholar
  5. [NIEV81]
    J. Nievergelt, H. Hintenberger, K.C. Sevcik The Grid File: an adaptable, symmetric multikey file structure Internal Report No. 46, Institut für Informatik, ETH Zürich, December 1981.Google Scholar
  6. [OREN83]
    J.A. Orenstein Algorithms and data structures for the implementation of a relational database Technical Report SOCS-82-17 (1982), School of Computer Science, McGill University.Google Scholar
  7. [OUKS83]
    M. Ouksel, P. Scheuermann Storage Mapping for Multidimensional Linear Dynamic Hashing Proc. of 2nd Symposium on Principles of Database Systems, Atlanta, 1983.Google Scholar
  8. [OZKA85]
    E.A. Ozkarahan, M. Ouksel Dynamic and Order Preserving Data Partitioning for Database Machines Proc. of 11th Int. Conf. on Very Large Data Bases, Stockholm, August 1985.Google Scholar
  9. [OHSA83]
    Y. Ohsawa, M. Sakauchi The BD-Tree: a new n-dimensional data structure with highly efficient dynamic characteristics IFIP 9th World Computer Congress, Paris, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • M. W. Freeston
    • 1
  1. 1.ECRCMünchen 81West Germany

Personalised recommendations