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
203
Robert Lanfear, Paul B. Frandsen, April Wright et al. · Molecular Biology and Evolution · 2016 · 5.4K citations · Full text
Selecting optimal partitioning schemes for phylogenomic datasets
Robert Lanfear, Brett Calcott, David Kainer et al. · BMC Evolutionary Biology · 2014 · 787 citations · Full text
1–5 of 203
550
8
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 550
251

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
5 h-index
9 publications
239 citations

University of Minnesota
Minneapolis, United States
5 h-index
10 publications
2K citations

Australian National University
Canberra, Australia
5 h-index
9 publications
20K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
8 publications
641 citations
The Ohio State University
Columbus, United States
4 h-index
8 publications
142 citations

The University of Sydney
Sydney, Australia
4 h-index
4 publications
11.3K citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
4 h-index
7 publications
1.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
7 publications
338 citations
1–8 of 251
PVLDB · 4 publications · 249 citations
4
h-index
TPDS · 3 publications · 129 citations
3
h-index
2 publications · 222 citations
3
h-index
FGCS · 3 publications · 104 citations
3
h-index
MBE · 3 publications · 11.4K citations
3
h-index
1–5