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
Parents
23
Analysis of object oriented spatial access methods
Christos Faloutsos, Timos Sellis, Nick Roussopoulos · 1987 · 153 citations · Full text
1–5 of 23
42
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 42
22
University of Maryland, College Park
College Park, United States
6 h-index
12 publications
972 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
1.1K citations
United States Census Bureau
Suitland, United States
2 h-index
2 publications
86 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
1.3K citations

Research Institute for Advanced Computer Science
Mountain View, United States
2 h-index
2 publications
86 citations
Seoul National University
Seoul, South Korea
2 h-index
6 publications
447 citations

University of Calabria
Rende, Italy
1 h-index
1 publications
85 citations
Wuhan University
Wuhan, China
1 h-index
2 publications
176 citations
1–8 of 22
3 publications · 92 citations
3
h-index
Conference · 1 publications · 104 citations
1
h-index
Repository · 1 publications · 1.3K citations
1
h-index
Repository · 1 publications · 42 citations
1
h-index
Repository · 1 publications · 468 citations
1
h-index
1–5