BANG file

Last updated June 20, 2025

A BANG file (balanced and nested grid file) is a point access method which divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash. Cells may intersect and points may be distributed between them.^[1]^[2]

References

↑ Freeston, Michael (1987). "The BANG file: A new kind of grid file". SIGMOD '87: Proceedings of the 1987 ACM SIGMOD international conference on Management of data. pp. 260–269. doi: 10.1145/38713.38743 .
↑ Freeston, M. W. (June 21–23, 1989). "Advances in the design of the BANG file" . In Litwin, Witold; Schek, Hans-Jörg (eds.). Foundations of Data Organization and Algorithms. 3rd International Conference, FODO 1989. Paris, France. pp. 321–338. doi:10.1007/3-540-51295-0_140.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Freeston, Michael (1987). "The BANG file: A new kind of grid file". SIGMOD '87: Proceedings of the 1987 ACM SIGMOD international conference on Management of data. pp. 260–269. doi: 10.1145/38713.38743 .

[2] Freeston, M. W. (June 21–23, 1989). "Advances in the design of the BANG file" . In Litwin, Witold; Schek, Hans-Jörg (eds.). Foundations of Data Organization and Algorithms. 3rd International Conference, FODO 1989. Paris, France. pp. 321–338. doi:10.1007/3-540-51295-0_140.

[1]

[2]