Partitioning Schemes

Partitioning Schemes is a distributed database design methodology that specifies how data is divided and distributed across multiple nodes according to defined rules, distinguishing it from other data management strategies by its focus on horizontal or vertical decomposition to enhance scalability, availability, and performance.

203

Publications

29.1K

Citations

550

Authors

251

Institutions

Publications per year

2017–2026

34

Variants

Data Partitioning Schemes

Authors

550

  1. GK
    George Karypis

    University of Minnesota, United States

    8 publications · 8.6K citations

    8

    h-index

  2. VK
    Vipin Kumar

    University of Minnesota, United States

    5 publications · 8.2K citations

    5

    h-index

  3. RL
    Robert Lanfear

    Australian National University, Australia

    5 publications · 12.3K citations

    5

    h-index

  4. QL
    Qing Li

    City University of Hong Kong, Hong Kong SAR China

    3 publications · 72 citations

    4

    h-index

  5. BC
    Brett Calcott

    Australian National University, Australia

    4 publications · 12.1K citations

    4

    h-index

1–5 of 550

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 249 citations

    4

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 129 citations

    3

    h-index

  3. Systematic Biology

    2 publications · 222 citations

    3

    h-index

  4. Future Generation Computer Systems

    FGCS · 3 publications · 104 citations

    3

    h-index

  5. Molecular Biology and Evolution

    MBE · 3 publications · 11.4K citations

    3

    h-index

1–5