Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle

    Erweiterungen relationaler Datenbanksysteme um geometrische Frontends haben sich bisher gegenüber spezialisierten Geodatenbanksystemen meist als ineffizient erwiesen. In dieser Arbeit zeigen wir, daß eine gute...

    A. Henrich, A. Hilbert, H.-W. Six in Datenbanksysteme in Büro, Technik und Wiss… (1991)

  2. No Access

    Article

    The implementation of insertion and deletion algorithms for 1–2 brother trees

    We derive an implementation in PASCAL of the insertion and deletion algorithms for 1–2 brother trees. The implementation is of interest not only in its own right but also in that it has given rise to an improv...

    Th. Ottmann, H. -W. Six, D. Wood in Computing (1981)

  3. No Access

    Article

    One-sided k-height-balanced trees

    The purpose of this paper is to generalize the recent results on one-sided height-balanced trees (OSHB trees) to the case of one-sidedk-height-balanced trees, fork≥2. Surprisingly, this generalization leads to 0 ...

    Th. Ottmann, H. W. Six, D. Wood in Computing (1979)

  4. No Access

    Article

    On the correspondence between AVL trees and brother trees

    We discuss the relationships of the classes of height-balanced (search) trees and the classes of brother (search) trees. In particular we characterize each class of height-balanced trees in terms of the class ...

    Th Ottmann, H. -W. Six, D. Wood in Computing (1979)