Dynamic Range Searching

Dynamic Range Searching is a computational framework within the domain of range searching that supports efficient querying of geometric or multidimensional data sets while allowing incremental insertions and deletions of data points.

29

Publications

1.3K

Citations

69

Authors

35

Institutions

Publications per year

2017–2026

3

Authors

69

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    3 publications · 289 citations

    3

    h-index

  2. GS
    George S. Lueker

    University of California, Irvine, United States

    3 publications · 239 citations

    3

    h-index

  3. CW
    Christian Worm Mortensen

    IT University of Copenhagen, Denmark

    2 publications · 94 citations

    2

    h-index

  4. DE
    Darren Erik Vengroff

    Duke University, United States

    2 publications · 150 citations

    2

    h-index

  5. DE
    Dan E. Willard

    University at Albany, State University of New York, United States

    2 publications · 220 citations

    2

    h-index

1–5 of 69

Venues

  1. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 2 publications · 67 citations

    2

    h-index

  2. Software Practice and Experience

    1 publications · 15 citations

    1

    h-index

  3. Data & Knowledge Engineering

    DKE · 1 publications · 29 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 25 citations

    1

    h-index

  5. Journal of Computer and System Sciences

    1 publications · 78 citations

    1

    h-index

1–5