R-tree Indexing
R-Tree Indexing is a spatial indexing method that organizes multi-dimensional data in a hierarchical tree structure where each node bounds multiple child nodes using minimum bounding rectangles, enabling efficient range queries and nearest-neighbor searches in spatial databases.
204
Publications
36.3K
Citations
449
Authors
189
Institutions
Publications per year
2017–2026
25
Parents
204
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Erich Schubert, Jörg Sander, Martin Ester et al. · ACM Transactions on Database Systems · 2017 · 2.6K citations
Fast subsequence matching in time-series databases
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos · 1994 · 1.7K citations · Full text
Antonin Guttman · ACM SIGMOD Record · 1984 · 1.6K citations · Full text
1–5 of 204
449
10
h-index
10
h-index
9
h-index
9
h-index
9
h-index
1–5 of 449
189
University of Maryland, College Park
College Park, United States
15 h-index
41 publications
15.7K citations
Aalborg University
Aalborg, Denmark
11 h-index
26 publications
4.8K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
7 h-index
11 publications
754 citations
University of California, Berkeley
Berkeley, United States
6 h-index
8 publications
9.6K citations

The University of Melbourne
Melbourne, Australia
5 h-index
11 publications
282 citations
Wuhan University
Wuhan, China
5 h-index
13 publications
362 citations
University of Southern California
Los Angeles, United States
5 h-index
11 publications
329 citations
AT&T (United States)
Bedminster, United States
5 h-index
6 publications
655 citations
1–8 of 189
15 publications · 5.8K citations
14
h-index
TKDE · 10 publications · 354 citations
10
h-index
TODS · 6 publications · 2.8K citations
6
h-index
PVLDB · 5 publications · 217 citations
5
h-index
4 publications · 309 citations
4
h-index
1–5