R+ Trees

R+ Trees is a type of spatial index structure that partitions multidimensional data using a hierarchical, tree-based organization where overlapping of internal nodes is prohibited to improve query performance.

23

Publications

3.3K

Citations

42

Authors

22

Institutions

Publications per year

2017–2026

3

Variants

R+-trees

Authors

42

  1. CF
    Christos Faloutsos

    Carnegie Mellon University, United States

    4 publications · 1.5K citations

    4

    h-index

  2. NR
    Nick Roussopoulos

    University of Maryland, College Park, United States

    3 publications · 1.5K citations

    3

    h-index

  3. HS
    Hanan Samet

    University of Maryland, College Park, United States

    3 publications · 153 citations

    3

    h-index

  4. EH
    Erik Hoel

    University of Maryland, College Park, United States

    3 publications · 153 citations

    3

    h-index

  5. TS
    Timos Sellis

    National Technical University of Athens, Greece

    3 publications · 1.5K citations

    3

    h-index

1–5 of 42

Venues

  1. ACM SIGMOD Record

    3 publications · 92 citations

    3

    h-index

  2. Very Large Data Bases

    Conference · 1 publications · 104 citations

    1

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. Minds at UW (University of Wisconsin)

    Repository · 1 publications · 468 citations

    1

    h-index

1–5