External Memory R-trees

External Memory R-Trees is a spatial indexing structure designed for efficiently managing and querying large multidimensional datasets stored in external memory, distinguished by its adaptation of the R-tree hierarchy to minimize I/O operations in disk-based systems.

22

Publications

3.9K

Citations

71

Authors

8

Institutions

Publications per year

2017–2026

0

Authors

71

  1. MJ
    Matthias Jarke

    RWTH Aachen University, Germany

    2 publications · 577 citations

    2

    h-index

  2. MJ
    Michael J. Carey

    University of Wisconsin–Madison, United States

    2 publications · 185 citations

    2

    h-index

  3. GM
    Guy M. Lohman

    IBM Research - Almaden, United States

    2 publications · 506 citations

    2

    h-index

  4. MK
    Martin Kersten

    Centrum Wiskunde & Informatica, Netherlands

    2 publications · 485 citations

    2

    h-index

  5. JB
    Jorge B. Bocca

    1 publications · 450 citations

    1

    h-index

1–5 of 71

Venues

  1. Algorithmica

    2 publications · 250 citations

    2

    h-index

  2. Medical Entomology and Zoology

    1 publications · 447 citations

    1

    h-index

  3. Data Archiving and Networked Services (DANS)

    Repository · 1 publications · 38 citations

    1

    h-index

  4. The VLDB Journal

    1 publications · 54 citations

    1

    h-index

  5. Research Explorer (The University of Manchester)

    Repository · 1 publications · 127 citations

    1

    h-index

1–5