R* Trees

R* Trees is a spatial index structure that refines the R-tree by employing a revised node split algorithm and minimizing both overlap and coverage of bounding rectangles to improve query performance.

72

Publications

13.2K

Citations

168

Authors

74

Institutions

Publications per year

2017–2026

6

Authors

168

  1. BS
    Bernhard Seeger

    Philipps University of Marburg, Germany

    7 publications · 6.6K citations

    7

    h-index

  2. CS
    Christian S. Jensen

    Aalborg University, Denmark

    6 publications · 1.7K citations

    6

    h-index

  3. WL
    Wang-Chien Lee

    Pennsylvania State University, United States

    6 publications · 300 citations

    6

    h-index

  4. DP
    Dimitris Papadias

    Hong Kong University of Science and Technology, Hong Kong SAR China

    5 publications · 584 citations

    5

    h-index

  5. YT
    Yannis Theodoridis

    University of Piraeus, Greece

    5 publications · 603 citations

    5

    h-index

1–5 of 168

Venues

  1. ACM SIGMOD Record

    6 publications · 2.9K citations

    6

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 145 citations

    5

    h-index

  3. Proceedings - International Conference on Data Engineering

    ICDE · 2 publications · 311 citations

    2

    h-index

  4. Very Large Data Bases

    Conference · 2 publications · 144 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 2 publications · 37 citations

    2

    h-index

1–5