Space-partitioning Trees

Space-Partitioning Trees is a spatial data structure that recursively subdivides a multidimensional space into non-overlapping regions through hierarchical tree-based decomposition, enabling efficient nearest neighbor search by localizing queries within successively finer partitions.

172

Publications

8.8K

Citations

422

Authors

200

Institutions

Publications per year

2017–2026

18

Authors

422

  1. BN
    Bruce Naylor

    AT&T (United States), United States

    4 publications · 346 citations

    4

    h-index

  2. JW
    Jingdong Wang

    Microsoft Research Asia (China), China

    4 publications · 223 citations

    4

    h-index

  3. FY
    Fei Yao

    Wuhan University, China

    3 publications · 168 citations

    3

    h-index

  4. DA
    Daniel A. Keim

    University of Konstanz, Germany

    3 publications · 144 citations

    3

    h-index

  5. GN
    Gonzalo Navarro

    University of Chile, Chile

    3 publications · 82 citations

    3

    h-index

1–5 of 422

Venues

  1. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 237 citations

    5

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 5 publications · 265 citations

    5

    h-index

  3. Pattern Recognition

    5 publications · 525 citations

    5

    h-index

  4. Information Systems

    4 publications · 125 citations

    4

    h-index

  5. arXiv (Cornell University)

    Repository · 4 publications · 102 citations

    4

    h-index

1–5