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

Authors

449

  1. YT
    Yannis Theodoridis

    University of Piraeus, Greece

    11 publications · 1.4K citations

    10

    h-index

  2. CF
    Christos Faloutsos

    Carnegie Mellon University, United States

    10 publications · 4.6K citations

    10

    h-index

  3. NR
    Nick Roussopoulos

    University of Maryland, College Park, United States

    9 publications · 3.7K citations

    9

    h-index

  4. SŠ
    Simonas Šaltenis

    Aalborg University, Denmark

    9 publications · 1.8K citations

    9

    h-index

  5. CS
    Christian S. Jensen

    Aalborg University, Denmark

    9 publications · 2.2K citations

    9

    h-index

1–5 of 449

Venues

  1. ACM SIGMOD Record

    15 publications · 5.8K citations

    14

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 10 publications · 354 citations

    10

    h-index

  3. ACM Transactions on Database Systems

    TODS · 6 publications · 2.8K citations

    6

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 5 publications · 217 citations

    5

    h-index

  5. 4

    h-index

1–5